Subjects -> MATHEMATICS (Total: 1100 journals)     - APPLIED MATHEMATICS (88 journals)    - GEOMETRY AND TOPOLOGY (23 journals)    - MATHEMATICS (812 journals)    - MATHEMATICS (GENERAL) (43 journals)    - NUMERICAL ANALYSIS (24 journals)    - PROBABILITIES AND MATH STATISTICS (110 journals) MATHEMATICS (812 journals)                  1 2 3 4 5 | Last

1 2 3 4 5 | Last

Similar Journals
 Cryptography and CommunicationsJournal Prestige (SJR): 0.446 Citation Impact (citeScore): 1Number of Followers: 13      Hybrid journal (It can contain Open Access articles) ISSN (Print) 1936-2455 - ISSN (Online) 1936-2447 Published by Springer-Verlag  [2626 journals]
• Repeated-root constacyclic codes of length 2 p s over F p m + u F p m + u
2 F p m $\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}$
• Abstract: Let λ be a unit of the finite commutative chain ring $$R=\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}=\{\alpha +u\upbeta +u^{2}\gamma : \alpha ,\upbeta ,\gamma \in \mathbb { F}_{p^{m}}\}$$ with u3 = 0, where p is an odd prime and m is a positive integer. In this paper, we consider any λ-constacyclic codes of length 2ps over R. In the case of square λ = δ2, where δ ∈ R, the algebraic structures of all λ-constacyclic codes of length 2ps over R are determined by the Chinese Remainder Theorem in terms of polynomial generators. Precisely, each λ-constacyclic code of length 2ps is represented as a direct sum of a (−δ)-constacyclic code and a δ-constacyclic code of length ps. In the case of non-square λ = α + uβ + u2γ or λ = α + uβ, where $$\alpha ,\upbeta ,\gamma \in \mathbb {F}_{p^{m}}\setminus \{0\}$$ , it is shown that the ring $$\mathcal {R}=\frac {R[x]}{\langle x^{2p^{s}}-\lambda \rangle }$$ is a chain ring. In the case of non-square $$\lambda =\alpha \in \mathbb {F}_{p^{m}}\setminus \{0\}$$ , it turns out that λ-constacyclic codes are classified into 8 distinct types of ideals, and the detailed structures of ideals in each type are provided.
PubDate: 2020-08-09

• Computing the 2-adic complexity of two classes of Ding-Helleseth
generalized cyclotomic sequences of periods of twin prime products
• Abstract: This paper contributes to compute the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that the 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.
PubDate: 2020-08-07

• On Euclidean Hulls of MDS Codes
• Abstract: In this paper, we propose a mechanism for the construction of MDS codes with arbitrary dimensions of Euclidean hulls. Precisely, we construct (extended) generalized Reed-Solomon (GRS) codes with assigned dimensions of Euclidean hulls from self-orthogonal GRS codes. It turns out our constructions are more general than previous works on Euclidean hulls of (extended) GRS codes.
PubDate: 2020-07-28

• On decoding additive generalized twisted Gabidulin codes
• Abstract: In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field $$\mathbb {F}_{q^{n}}$$ for any prime power q. This paper extends the work of the conference paper Li and Kadir (2019) presented at the International Workshop on Coding and Cryptography 2019, which decoded these codes over finite fields in characteristic two.
PubDate: 2020-07-23

• Permutation polynomials and factorization
• Abstract: We discuss a special class of permutation polynomials over finite fields focusing on some recent work on their factorization. In particular we obtain permutation polynomials with various factorization patterns that are favoured for applications. We also address a wide range of problems of current interest concerning irreducible factors of the terms of sequences and iterations of such permutation polynomials.
PubDate: 2020-07-22

• Boolean functions with multiplicative complexity 3 and 4
• Abstract: Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fisher and Peralta (2002), and Find et al. (IJICoT 4(4), 222–236, 2017), respectively. In this work, we identify the affine equivalence classes for functions with MC 3 and 4. In order to achieve this, we utilize the notion of the dimension dim(f) of a Boolean function in relation to its linearity dimension, and provide a new lower bound suggesting that the multiplicative complexity of f is at least ⌈dim(f)/2⌉. For MC 3, this implies that there are no equivalence classes other than those 24 identified in Çalık et al. (2018). Using the techniques from Çalık et al. and the new relation between the dimension and MC, we identify all 1277 equivalence classes having MC 4. We also provide a closed formula for the number of n-variable functions with MC 3 and 4. These results allow us to construct AND-optimal circuits for Boolean functions that have MC 4 or less, independent of the number of variables they are defined on.
PubDate: 2020-07-18

• Two constructions of asymptotically optimal codebooks via the trace
functions
• Abstract: In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determin the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the Welch bound. Moreover, in the first construction, we generalize the result in Zhang and Feng (IEEE Trans. Inform. Theory 58(4), 2507–2511, 2012). In the second construction, we generalize the results in Hong et al. (IEEE Trans. Inf. Theory 60(6), 3698–3705, 2014), we can asymptotically achieve Welch bound for any odd prime p, we also derive the whole distribution of their inner products. The parameters of these codebooks are new.
PubDate: 2020-07-15

• Vectorial bent functions in odd characteristic and their components
• Abstract: Bent functions in odd characteristic can be either (weakly) regular or non-weakly regular. Furthermore one can distinguish between dual-bent functions, which are bent functions for which the dual is bent as well, and non-dual bent functions. Whereas a weakly regular bent function always has a bent dual, a non-weakly regular bent function can be either dual-bent or non-dual-bent. The classical constructions (like quadratic bent functions, Maiorana-McFarland or partial spread) yield weakly regular bent functions, but meanwhile one knows constructions of infinite classes of non-weakly regular bent functions of both types, dual-bent and non-dual-bent. In this article we focus on vectorial bent functions in odd characteristic. We first show that most p-ary bent monomials and binomials are actually vectorial constructions. In the second part we give a positive answer to the question if non-weakly regular bent functions can be components of a vectorial bent function. We present the first construction of vectorial bent functions of which the components are non-weakly regular but dual-bent, and the first construction of vectorial bent functions with non-dual-bent components.
PubDate: 2020-07-15

• Cryptographic properties of small bijective S-boxes with respect to
• Abstract: We define affine equivalence of S-boxes with respect to modular addition, and explore its use in cryptanalysis. We have identified classes of small bijective S-boxes with respect to this new equivalence, and experimentally computed their properties.
PubDate: 2020-07-10

• Some new bounds on LCD codes over finite fields
• Abstract: In this paper, we show that LCD codes are not equivalent to non-LCD codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n,2) over $$\mathbb {F}_{3}$$ and $$\mathbb {F}_{4}$$ , where LD(n,2) := max{d∣thereexsitsan [n,2, d] LCD $$code~ over~ \mathbb {F}_{q}\}$$ . We study the bound of LCD codes over $$\mathbb {F}_{q}$$ and generalize a conjecture proposed by Galvez et al. about the minimum distance of binary LCD codes.
PubDate: 2020-07-01

• On degree- d zero-sum sets of full rank
• Abstract: A set $$S \subseteq {{\mathbb {F}}_{2}^{n}}$$ is called degree-d zero-sum if the sum $${\sum }_{s \in S} f(s)$$ vanishes for all n-bit Boolean functions of algebraic degree at most d. Those sets correspond to the supports of the n-bit Boolean functions of degree at most n − d − 1. We prove some results on the existence of degree-d zero-sum sets of full rank, i.e., those that contain n linearly independent elements, and show relations to degree-1 annihilator spaces of Boolean functions and semi-orthogonal matrices. We are particularly interested in the smallest of such sets and prove bounds on the minimum number of elements in a degree-d zero-sum set of rank n. The motivation for studying those objects comes from the fact that degree-d zero-sum sets of full rank can be used to build linear mappings that preserve special kinds of nonlinear invariants, similar to those obtained from orthogonal matrices and exploited by Todo, Leander and Sasaki for breaking the block ciphers Midori, Scream and iScream.
PubDate: 2020-07-01

• New asymptotically optimal three-dimensional wave-length/space/time
optical orthogonal codes for OCDMA systems
• Abstract: We present new families of three-dimensional (3-D) optical orthogonal codes for applications to optical code-division multiple access (OCDMA) networks. The families are based in the extended rational cycle used for the 2-D Moreno-Maric construction. The new families are asymptotically optimal with respect to the Johnson bound.
PubDate: 2020-07-01

• On the number of the rational zeros of linearized polynomials and the
second-order nonlinearity of cubic Boolean functions
• Abstract: Determine the number of the rational zeros of any given linearized polynomial is one of the vital problems in finite field theory, with applications in modern symmetric cryptosystems. But, the known general theory for this task is much far from giving the exact number when applied to a specific linearized polynomial. The first contribution of this paper is a better general method to get a more precise upper bound on the number of rational zeros of any given linearized polynomial over arbitrary finite field. We anticipate this method would be applied as a useful tool in many research branches of finite field and cryptography. Really we apply this result to get tighter estimations of the lower bounds on the second-order nonlinearities of general cubic Boolean functions, which has been an active research problem during the past decade. Furthermore, this paper shows that by studying the distribution of radicals of derivatives of a given Boolean function one can get a better lower bound of the second-order nonlinearity, through an example of the monomial Boolean functions $$g_{\mu }=Tr(\mu x^{2^{2r}+2^{r}+1})$$ defined over the finite field $${\mathbb F}_{2^{n}}$$ .
PubDate: 2020-07-01

• Solving x + x 2 l + ⋯ + x 2 m l = a $x+x^{2^{l}}+\cdots +x^{2^{ml}}=a$
over F 2 n $\mathbb {F}_{2^{n}}$
• Abstract: This paper presents an explicit representation for the solutions of the equation $${\sum }_{i=0}^{\frac kl-1}x^{2^{li}} = a \in \mathbb {F}_{2^{n}}$$ for any given positive integers k, l with l k and n, in the closed field $${\overline {\mathbb {F}_{2}}}$$ and in the finite field $$\mathbb {F}_{2^{n}}$$ . As a by-product of our study, we are able to completely characterize the a’s for which this equation has solutions in $$\mathbb {F}_{2^{n}}$$ .
PubDate: 2020-07-01

• Almost supplementary difference sets and quaternary sequences with optimal
autocorrelation
• Abstract: We introduce almost supplementary difference sets (ASDS). For odd m, certain ASDS in $$\mathbb Z_{m}$$ that have amicable incidence matrices are equivalent to quaternary sequences of odd length m with optimal autocorrelation. As one consequence, if 2m − 1 is a prime power, or m ≡ 1 mod 4 is prime, then ASDS of this kind exist. We also explore connections to optimal binary sequences and group cohomology.
PubDate: 2020-07-01

• Double bordered constructions of self-dual codes from group rings over
Frobenius rings
• Abstract: In this work, we describe a double bordered construction of self-dual codes from group rings. We show that this construction is effective for groups of order 2p where p is odd, over the rings $$\mathbb {F}_{2}+u\mathbb {F}_{2}$$ and $$\mathbb {F}_{4}+u\mathbb {F}_{4}$$ . We demonstrate the importance of this new construction by finding many new binary self-dual codes of lengths 64, 68 and 80; the new codes and their corresponding weight enumerators are listed in several tables.
PubDate: 2020-07-01

• Notes on generalized Hamming weights of some classes of binary codes
• Abstract: Some classes of binary codes constructed by using some defining sets are studied, and for most defining sets, we will determine the generalized Hamming weight of the corresponding codes completely, and for other defining sets, we will determine part of the generalized Hamming weight of the corresponding codes.
PubDate: 2020-07-01

• The 2-adic complexity of a class of binary sequences with optimal
autocorrelation magnitude
• Abstract: Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on Ding-Helleseth-Lam sequences and interleaving technique (Designs, Codes and Cryptography 86, 1329–1338, 2018). The linear complexity of this class of sequences has been proved to be large enough to resist the B-M Algorithm by Fan (Designs, Codes and Cryptography 86, 2441–2450, 2018). In this paper, we study the 2-adic complexities of these sequences with period 4p and show they are no less than 2p, i.e., its 2-adic complexity is large enough to resist the Rational Approximation Algorithm.
PubDate: 2020-07-01

• About the linear complexity of quaternary sequences with even length
• Abstract: Several classes of quaternary sequences of even period with optimal autocorrelation have been constructed by Su et al. based on interleaving certain kinds of binary sequences of odd period, i.e. Legendre sequence, twin-prime sequence and generalized GMW sequence. In this correspondence, the exact values of linear complexity over finite field $$\mathbb {F}_{4}$$ and Galois ring $$\mathbb {Z}_{4}$$ of the quaternary sequences are derived, respectively.
PubDate: 2020-07-01

• The minimum distance of new generalisations of the punctured binary
Reed-Muller codes
• Abstract: In 2018, Ding et al. introduced a new generalisation of the punctured binary Reed-Muller codes to construct LCD codes and 2-designs. They studied the minimum distance of the codes and proposed an open problem about the minimum distance. In this paper, several new results on the minimum distance of the generalised punctured binary Reed- Muller are presented. Particularly, some of the results are a generalisation or improvement of previous results in (Finite Fields Appl. 53, 144–174, 2018).
PubDate: 2020-07-01

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762