• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-28
Xiaolei Fang, Meiqing Liu, Jinquan Luo

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.

更新日期：2020-07-28
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-23

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

更新日期：2020-07-23
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-22
Tekgül Kalaycı, Henning Stichtenoth, Alev Topuzoğlu

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

更新日期：2020-07-22
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-18
Çağdaş Çalık, Meltem Sönmez Turan, René Peralta

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

更新日期：2020-07-18
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-15
Xia Wu, Wei Lu, Xiwang Cao

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

更新日期：2020-07-15
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-15
Ayça Çeşmelioğlu, Wilfried Meidl, Alexander Pott

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

更新日期：2020-07-15
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-07-10
Pavol Zajac, Matúš Jókay

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.

更新日期：2020-07-10
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-06-25
Yuri Borissov, Lyubomir Borissov

The Fischer result about distinctness of the Kloosterman sums on F∗p is extended for the finite fields of degrees of extension that are powers of 2. To obtain the desired outcome, we give an elementary proof of the fact that there does not exist a pair of Kloosterman sums on same odd characteristic fields which are opposite to each other.

更新日期：2020-06-25
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-06-24
Faruk Göloğlu

Recently, Carlet introduced (Carlet Finite. Fields Appl. 53, 226–253 (2018)) the concept of component-wise uniform (CWU) functions which is a stronger notion than being almost perfect nonlinear (APN). Carlet showed that crooked functions (in particular quadratic functions, including Gold functions) and the compositional inverse of a specific Gold function are CWU. Carlet also compiled a table on the

更新日期：2020-06-24
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-06-22
Luis A. Medina, Matthew G. Parker, Constanza Riera, Pantelimon Stănică

In this paper we define a new transform on (generalized) Boolean functions, which generalizes the Walsh-Hadamard, nega-Hadamard, 2k-Hadamard, consta-Hadamard and all HN-transforms. We describe the behavior of what we call the root-Hadamard transform for a generalized Boolean function f in terms of the binary components of f. Further, we define a notion of complementarity (in the spirit of the Golay

更新日期：2020-06-23
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-06-18
Cunsheng Ding, Chunming Tang

A special function is a function either of special form or with a special property. Special functions have interesting applications in coding theory and combinatorial t-designs. The main objective of this paper is to survey t-designs constructed from special functions, including quadratic functions, almost perfect nonlinear functions, almost bent functions, bent functions, bent vectorial functions

更新日期：2020-06-18
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-06-11
Marco Calderini, Irene Villa

The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis. In particular it takes into consideration two differentials, one for the upper part of the cipher and one for the lower part, and it exploits the dependency of these two differentials. At Eurocrypt’18, Cid et al. introduced a new tool, called the Boomerang Connectivity

更新日期：2020-06-11
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-06-11
Aleksandr Kutsenko

A bent function is a Boolean function in even number of variables which is on the maximal Hamming distance from the set of affine Boolean functions. It is called self-dual if it coincides with its dual. It is called anti-self-dual if it is equal to the negation of its dual. A mapping of the set of all Boolean functions in n variables to itself is said to be isometric if it preserves the Hamming distance

更新日期：2020-06-11
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-05-16
Patrick Felke

Let f(x) = xd be a power mapping over $$\mathbb {F}_{n}$$ and $$\mathcal {U}_{d}$$ the maximum number of solutions $$x\in \mathbb {F}_{n}$$ of $${\Delta }_{f,c}(x):=f(x+c)-f(x)=a\text {, where }c,a\in \mathbb {F}_{n}\text { and } c\neq 0$$. f is said to be differentially k-uniform if $$\mathcal {U}_{d} =k$$. The investigation of power functions with low differential uniformity over finite fields $$\mathbb 更新日期：2020-05-16 • Cryptogr. Commun. (IF 1.291) Pub Date : 2020-05-14 Lijing Zheng, Jie Peng, Haibin Kan, Yanjun Li Inspired by a recent work of Tang et al. on constructing bent functions [14, IEEE TIT, 63(1): 6149-6157, 2017], we introduce a property (Pτ) of any Boolean function that its second order derivatives vanish at any direction (ui,uj) for some τ-subset {u1,…,uτ} of \(\mathbb {F}_{2^{n}}$$, and then establish a link between this property and the construction of Tang et al. (IEEE Trans. Inf. Theory 63(10)

更新日期：2020-05-14
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-05-07
Nian Li, Sihem Mesnager

Linear codes have a wide range of applications in the data storage systems, communication systems, consumer electronics products since their algebraic structure can be analyzed and they are easy to implement in hardware. How to construct linear codes with excellent properties to meet the demands of practical systems becomes a research topic, and it is an efficient way to construct linear codes from

更新日期：2020-05-07
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-04-18
Christof Beierle, Gregor Leander

We consider n-bit permutations with differential uniformity of 4 and null nonlinearity. We first show that the inverses of Gold functions have the interesting property that one component can be replaced by a linear function such that it still remains a permutation. This directly yields a construction of 4-uniform permutations with trivial nonlinearity in odd dimension. We further show their existence

更新日期：2020-04-18
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-04-06
Marco Calderini

Recently Budaghyan et al. (Cryptogr. Commun. 12, 85–100, 2020) introduced a procedure for investigating if CCZ-equivalence can be more general than EA-equivalence together with inverse transformation (when applicable). In this paper, we show that it is possible to use this procedure for classifying, up to EA-equivalence, all known APN functions in dimension 6. We also give some discussion for dimension

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-04-06
Krishna Gopal Benerjee, Manish K. Gupta

For a Distributed Storage System (DSS), the Fractional Repetition (FR) code is a class in which replicas of encoded data packets are stored on distributed chunk servers, where the encoding is done using the Maximum Distance Separable (MDS) code. The FR codes allow for the exact uncoded repair with minimum repair bandwidth. In this paper, FR codes (called Flower codes) are constructed using finite binary

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-04-04
Xiaoqiang Wang, Dabin Zheng

Let $$\mathbb {F}_{2^{m}}$$ be the finite field with 2m elements, where m is a positive integer. Recently, Heng and Ding in (Finite Fields Appl. 56:308–331, 2019) studied the subfield codes of two families of hyperovel codes and determined the weight distribution of the linear code  \mathcal{C}_{a,b}=\left\{((\text{Tr}_{1}^{m}(a f(x)+bx)+c)_{x \in \mathbb{F}_{2^{m}}}, \text{Tr}_{1}^{m}(a), \text{Tr}_{1}^{m}(b))

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-04-03
A. Musukwa, M. Sala

The set of linear structures of most known balanced Boolean functions is non-trivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension must have a component whose set of linear structures is trivial. We determine a general form for the number of bent components in quadratic APN functions in even

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-03-25
Yuan Cao, Yonglin Cao, Ramakrishna Bandi, Fang-Wei Fu

We correct some mistakes in the paper “A mass formula for negacyclic codes of length 2k and some good negacyclic codes over $$\mathbb {Z}_{4}+u\mathbb {Z}_{4}$$” (Bandi et al. Cryptogr. Commun. 9, 241–272, 2017).

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-03-23
Nurdagül Anbar, Canan Kaşıkçı, Wilfried Meidl, Alev Topuzoğlu

A bent4 function is a Boolean function with a flat spectrum with respect to a certain unitary transform $$\mathcal {T}$$. It was shown previously that a Boolean function f in an even number of variables is bent4 if and only if f + σ is bent, where σ is a certain quadratic function depending on $$\mathcal {T}$$. Hence bent4 functions are also called shifted bent functions. Similarly, a Boolean function

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-03-05
Jing Jiang, Minquan Cheng

The concept of a locally repairable code (LRC) was introduced to protect the data from disk failures in large-scale storage systems. In this paper, we consider the LRCs with multiple disjoint repair sets and each repair set contains exactly one check symbol. By using several structures from combinatorial design theory, such as balanced incomplete block design, cyclic packing, group divisible design

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-23

The original version of this article unfortunately contained a mistake in the main title.

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-10-07
Yuan Cao, Yonglin Cao

Let $$R=\mathbb {Z}_{4}[v]/\langle v^{2}+2v\rangle$$. Then R is a local non-principal ideal ring of 16 elements. First, we give the structure of every cyclic code of odd length n over R and obtain a complete classification for these codes. Then we determine the cardinality, the type and its dual code for each of these cyclic codes. Moreover, we determine all self-dual cyclic codes of odd length n

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-07-25
Guanmin Guo, Ruihu Li, Yang Liu, Junli Wang

In this paper, we investigate a family of q2-ary narrow-sense and non-narrow-sense negacyclic BCH codes with length $$n=\frac {q^{2m}-1}{2}$$, where q is an odd prime power and m ≥ 3 is odd. We propose Hermitian dual-containing conditions for narrow-sense and non-narrow-sense negacyclic BCH codes, and precisely compute the dimensions of these negacyclic BCH codes whose maximal designed distance can

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-02
Li Shuai, Lina Wang, Li Miao, Xianwei Zhou

In this paper, we study the differential uniformity of the composition of two functions with the help of Boolean matrix theory. Based on the result of our research, we can construct new differentially 4-uniform permutations from known ones. In addition, we find some clues about the existence of APN permutations of $$\mathbb {F}_{2^{n}}$$ for even n ≥ 8.

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-06
Zhonghua Sun, Shixin Zhu, Liqi Wang

Constacyclic codes are a subclass of linear codes and have been well studied. Constacyclic BCH codes are a family of constacyclic codes and contain BCH codes as a subclass. Compared with the in-depth study of BCH codes, there are relatively little study on constacyclic BCH codes. The objective of this paper is to determine the dimension and minimum distance of a class of q-ary constacyclic BCH codes

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-17
Zhongxiao Wang, Qunxiong Zheng, Wenfeng Qi

Let NFSR(f ) denote the nonlinear feedback shift register (NFSR) with characteristic function f = x0 ⊕ g(x1,x2,…,xn− 1) ⊕ xn. In this paper, the cycle structure of NFSR(fd) is discussed, where $$f^{d}=x_{0}\oplus g(x_{d},x_{2d},{\ldots } ,x_{(n-1)d})\oplus x_{nd}$$ is also a characteristic function determined by f and a given integer d. If the cycle structure of NFSR(f ) is known, then it is shown

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-23
Ting Yao, Shixin Zhu

We construct a class of $$\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}$$-additive cyclic codes generated by pairs of polynomials, where p is a prime number. The generator matrix of this class of codes is obtained. By establishing the relationship between the random $$\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}$$-additive cyclic code and random quasi-cyclic code of index 2 over $$\mathbb {Z}_{p}$$, the asymptotic properties

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-06

This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors within a b-bit byte (1 ≤ l < b) and double asymmetric errors within a codeword. The presented codes are constructed with the help of a computer and have the potential to be used in unamplified optical networks. In addition, the paper derives the upper bound on code length and shows that the proposed codes

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-10-08

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weights d(n,k) among all binary linear complementary dual [n,k] codes. We determine d(n,4) for n ≡ 2,3,4,5,6,9,10,13 (mod 15), and d(n,5) for n ≡ 3,4,5,7,11,19,20, 22,26 (mod 31). Combined with known results, d(n,k) are also determined for

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-07-24
Tailin Niu, Kangquan Li, Longjiang Qu, Qiang Wang

Involutions over finite fields are permutations whose compositional inverses are themselves. Involutions especially over $$\mathbb {F}_{q}$$ with q is even have been used in many applications, including cryptography and coding theory. The explicit study of involutions (including their fixed points) has started with the paper (Charpin et al. IEEE Trans. Inf. Theory, 62(4), 2266–2276 2016) for binary

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-02-17
Büşra Özden, Oğuz Yayla

In this paper we study almost p-ary sequences and their autocorrelation coefficients. We first study the number ℓ of distinct out-of-phase autocorrelation coefficients for an almost p-ary sequence of period n + s with s consecutive zero-symbols. We prove an upper bound and a lower bound on ℓ. It is shown that ℓ can not be less than $$\min \limits \{s,p,n\}$$. In particular, it is shown that a nearly

更新日期：2020-04-16
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-02-11
Sihem Mesnager, Kwang Ho Kim, Jong Hyok Choe, Dok Nam Lee, Dae Song Go

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

更新日期：2020-02-11
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-01-30
Ch. Srikanth

We consider a special type of sequence of arithmetic progressions, in which consecutive progressions are related by the property: ithterms ofjth, (j + 1)thprogressions of the sequence are multiplicative inverses of each other modulo(i + 1)thterm ofjthprogression. Such a sequence is uniquely defined for any pair of co-prime numbers. A computational problem, defined in the context of such a sequence

更新日期：2020-01-30
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-01-11
Liqin Hu, Keqin Feng

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

更新日期：2020-01-11
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-01-10
José Ortiz-Ubarri

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.

更新日期：2020-01-10
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-01-09
J. A. Armario, D. L. Flannery

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

更新日期：2020-01-09
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-01-09
Joe Gildea, Rhian Taylor, Abidin Kaya, A. Tylyshchak

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

更新日期：2020-01-09
• Cryptogr. Commun. (IF 1.291) Pub Date : 2020-01-09
Binbin Pang, Shixin Zhu, Xiaoshan Kai

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

更新日期：2020-01-09
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-12-14
Lu Zhao

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

更新日期：2019-12-14
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-30
Dan Zhang, Matthew Geoffrey Parker, Tor Helleseth

Sequence families with zero correlation zone (ZCZ) have been extensively studied in recent years due to their important applications in quasi-synchronous code-division multiple-access (QS-CDMA) systems. To accommodate multiuser environments, multiple ZCZ sequence sets with low inter-set cross-correlation are expected. In this paper, we propose a construction of polyphase ZCZ sequences based on generalised

更新日期：2019-11-30
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-27
Jasvinder Singh, Manish Gupta, Jaskarn Singh Bhullar

In this paper, a new and simple method for the construction of Girth-6 (J,L) Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes is proposed. The method is further extended to the search of Girth-8 QC-LDPC codes with base matrices of order 3 × L and 4 × L. The construction is based on three different forms of exponent matrices and the parameters α, p, and q which satisfy the necessary algebraic conditions

更新日期：2019-11-27
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-19
Christof Beierle, Alex Biryukov, Aleksei Udovenko

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

更新日期：2019-11-19
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-14
Yuhua Sun, Tongjiang Yan, Zhixiong Chen, Lianhai Wang

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)

更新日期：2019-11-14
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-13
Sihem Mesnager, Kwang Ho Kim, Myong Song Jo

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

更新日期：2019-11-13
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-12
Yajing Zhou, Zhengchun Zhou, Yang Yang, Yong Wang

Complementary sequences with quadrature amplitude modulation (QAM) symbols have important applications in OFDM communication systems. The objective of this paper is to present two constructions of 16-QAM complementary sequence sets of size 4. The first construction generates four complementary sequences of length L = 2m− 1 + 2v, where m and v are two positive integers with 1 ≤ v ≤ m − 1. The second

更新日期：2019-11-12
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-08
Yang Yang, Chunlei Li

A quaternary sequence is said to be optimal if its odd-periodic autocorrelation magnitude equal to 2 for even length, and 1 for odd length. In this paper, we propose three constructions of optimal quaternary sequences: the first construction applies the inverse Gray mapping to four component binary sequences, which could be chosen from GMW sequence pair, twin-prime sequence pair, Legendre sequence

更新日期：2019-11-08
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-11-08
Deng Tang, Xia Li

Due to the wide applications in communications, data storage and cryptography, linear codes have received much attention in the past decades. As a subclass of linear codes, minimal linear codes can be used to construct secret sharing with nice access structure. The objective of this paper is to construct new classes of minimal binary linear codes with $$w_{\min \limits }/w_{\max \limits }\leq 1/2$$

更新日期：2019-11-08
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-04-19
Joan Boyar,Magnus Gausdal Find,René Peralta

We present techniques to obtain small circuits which also have low depth. The techniques apply to typical cryptographic functions, as these are often specified over the field GF (2), and they produce circuits containing only AND, XOR and XNOR gates. The emphasis is on the linear components (those portions containing no AND gates). A new heuristic, DCLO (for depth-constrained linear optimization), is

更新日期：2019-11-01
• Cryptogr. Commun. (IF 1.291) Pub Date : 2016-07-28
Joan Boyar,Magnus Gausdal Find,René Peralta

A necessary condition for the security of cryptographic functions is to be "sufficiently distant" from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that six common measures, nonlinearity, algebraic degree, annihilator immunity, algebraic thickness, normality, and multiplicative complexity, are incomparable in the sense that for each pair of measures

更新日期：2019-11-01
• Cryptogr. Commun. (IF 1.291) Pub Date : null
Wilfried Meidl,Ísabel Pirsic

Depending on the parity of n and the regularity of a bent function f from F p n to F p , f can be affine on a subspace of dimension at most n/2, (n - 1)/2 or n/2 - 1. We point out that many p-ary bent functions take on this bound, and it seems not easy to find examples for which one can show a different behaviour. This resembles the situation for Boolean bent functions of which many are (weakly) n/2-normal

更新日期：2019-11-01
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-10-30
Zihui Liu, Jinliang Wang

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.

更新日期：2019-10-30
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-10-08
Domingo Gómez-Pérez, Ana I. Gómez, Andrew Tirkel

This paper generalizes three constructions of families of sequences with bounded off peak correlation with application to Code Division Multiple Access (CDMA), frequency hopping, and Ultra Wide Band (UWB). These new families present flexible family sizes and sequence lengths, making them well suited to wireless communications and Multiple Input Multiple Output (MIMO) radar. In particular, we show that

更新日期：2019-10-08
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-09-13
Zhimin Sun, Xiangyong Zeng, Da Lin

Based on the parity of the number of occurrences of a pattern 10 as a scattered subsequence in the binary representation of integers, a Rudin-Shapiro-like sequence is defined by Lafrance, Rampersad and Yee. The N th maximum order complexity and the expansion complexity of this Rudin-Shapiro-like sequence are calculated in this paper.

更新日期：2019-09-13
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-09-13
Hongyu Han, Sheng Zhang, Limengnan Zhou, Xing Liu

In quasi-synchronous frequency-hopping multiple-access systems where relative delays are restricted within a certain zone, low hit zone frequency-hopping sequences (LHZ FHSs) with favorable partial Hamming correlation properties are desirable. In this paper, we present a new class of LHZ FHS sets with optimal partial Hamming correlation based on t-decimation of m-sequence.

更新日期：2019-09-13
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-14
Minjia Shi, Chenchen Wang, Rongsheng Wu, Yu Hu, Yaoqiang Chang

In this paper, a class of additive codes which is referred to as $$\mathbb {Z}_{2}\mathbb {Z}_{2}[u,v]$$-additive codes is introduced. This is a generalization towards another direction of recently introduced $$\mathbb {Z}_{2}\mathbb {Z}_{4}$$ codes (Doughterty et al., Appl. Algebra Eng. Commun. Comput. 27(2), 123–138, 7). A MacWilliams-type identity that relates the weight enumerator of a code with

更新日期：2019-08-14
• Cryptogr. Commun. (IF 1.291) Pub Date : 2019-08-03
Shuxing Li, Alexander Pott

The concept of formal duality was proposed by Cohn, Kumar and Schürmann, which reflects a remarkable symmetry among energy-minimizing periodic configurations. This formal duality was later translated into a purely combinatorial property by Cohn, Kumar, Reiher and Schürmann, where the corresponding combinatorial objects were called formally dual pairs. So far, except the results presented in Li and

更新日期：2019-08-03
Contents have been reproduced by permission of the publishers.

down
wechat
bug