-
Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-21 Bolin Wang, Wenling Wu
The security requirements of new applications such as cloud computing, big data, and the Internet of Things have promoted the development and application of security protocols such as secure multi-party computation, fully homomorphic encryption, and zero-knowledge proof. In order to meet these demands, there is a need for new symmetric ciphers that minimize multiplications in \( {\mathbb {F}}_{2^{n}}
-
eSTARK: extending STARKs with arguments Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-20 Héctor Masip-Ardevol, Jordi Baylina-Melé, Marc Guzmán-Albiol, Jose Luis Muñoz-Tapia
-
New and improved formally self-dual codes with small hulls from polynomial four Toeplitz codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-20 Yang Li, Shitao Li, Shixin Zhu
Formally self-dual (FSD) codes and linear codes with small Euclidean (resp. Hermitian) hulls have recently attracted a lot of attention due to their theoretical and practical importance. However, there has been not much attention on FSD codes with small hulls. In this paper, we introduce two kinds of polynomial four Toeplitz codes and prove that they must be FSD. We characterize the linear complementary
-
A class of functions and their application in constructing semisymmetric designs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-20 Robert S. Coulter, Bradley Fain
We introduce the notion of a semiplanar function of index \(\lambda \), generalising several previous concepts. We show how semiplanar functions can be used to construct semisymmetric designs using an incidence structure determined by the function. Issues regarding the connectivity of the structure are then considered. The question of existence is addressed by establishing monomial examples over finite
-
CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-17 Shuichi Katsumata, Yi-Fu Lai, Jason T. LeGrow, Ling Qin
-
Non-canonical maximum cliques without a design structure in the block graphs of 2-designs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-18 Sergey Goryainov, Elena V. Konstantinova
In this note we answer positively a question of Chris Godsil and Karen Meagher on the existence of a 2-design whose block graph has a non-canonical maximum clique without a design structure.
-
Curve-lifted codes for local recovery using lines Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-17 Gretchen L. Matthews, Travis Morrison, Aidan W. Murphy
In this paper, we introduce curve-lifted codes over fields of arbitrary characteristic, inspired by Hermitian-lifted codes over \(\mathbb {F}_{2^r}\). These codes are designed for locality and availability, and their particular parameters depend on the choice of curve and its properties. Due to the construction, the numbers of rational points of intersection between curves and lines play a key role
-
Hulls of cyclic codes with respect to the regular permutation inner product Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-15 Xiaoshan Quan, Qin Yue, Fuqing Sun
In this paper, we introduce regular permutation inner products which contain the Euclidean inner product. And we generalize some properties of the Euclidean inner product to regular permutation inner products. As application, we construct a lot of cyclic codes with specific regular permutation hulls and also obtain the dimensions and distances of some BCH codes.
-
Explicit constructions of NMDS self-dual codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-12 Dongchun Han, Hanbin Zhang
Near maximum distance separable (NMDS) codes are important in finite geometry and coding theory. Self-dual codes are closely related to combinatorics, lattice theory, and have important application in cryptography. In this paper, we construct a class of q-ary linear codes and prove that they are either MDS or NMDS which depends on certain zero-sum condition. In the NMDS case, we provide an effective
-
New spence difference sets Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-10 James A. Davis, John Polhill, Ken Smith, Eric Swartz, Jordan Webster
-
Additivity of symmetric and subspace 2-designs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-05 Marco Buratti, Anamari Nakić
A 2-\((v,k,\lambda )\) design is additive (or strongly additive) if it is possible to embed it in a suitable abelian group G in such a way that its block set is contained in (or coincides with) the set of all zero-sum k-subsets of its point set. Explicit results on the additivity or strong additivity of symmetric designs and subspace 2-designs are presented. In particular, the strong additivity of
-
Vectorial negabent concepts: similarities, differences, and generalizations Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-05 Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan
In Pasalic et al. (IEEE Trans Inf Theory 69:2702–2712, 2023), and in Anbar and Meidl (Cryptogr Commun 10:235–249, 2018), two different vectorial negabent and vectorial bent-negabent concepts are introduced, which leads to seemingly contradictory results. One of the main motivations for this article is to clarify the differences and similarities between these two concepts. Moreover, the negabent concept
-
Around LCD group codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-05 Javier de la Cruz, Wolfgang Willems
In this note we answer some questions on \(\text{ LCD }\) group codes posed in de la Cruz and Willems (Des Codes Cryptogr 86:2065–2073, 2018) and (Vietnam J Math 51:721–729, 2023). Furthermore, over prime fields we determine completely the p-part of the divisor of an \(\text{ LCD }\) group code. In addition we present a natural construction of nearly \(\text{ LCD }\) codes.
-
Some self-dual codes and isodual codes constructed by matrix product codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-04 Xu Pan, Hao Chen, Hongwei Liu
In 2020, Cao et al. proved that any repeated-root constacyclic code is monomially equivalent to a matrix product code of simple-root constacyclic codes. In this paper, we study a family of matrix product codes with wonderful properties, which is a generalization of linear codes obtained from the \([u+v|u-v]\)-construction and \([u+v|\lambda ^{-1}u-\lambda ^{-1}v]\)-construction. Then we show that any
-
Some constacyclic BCH codes with good parameters Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-07-02 Jin Li, Huilian Zhu, Shan Huang
BCH codes as a subclass of constacyclic BCH codes have been widely studied, while the results on the parameters of BCH codes over finite fields are still very limited. In this paper, we investigate some q-ary BCH codes and \(\lambda \)-constacyclic BCH codes of length \(q^{m}+1\), where q is a prime power and \(\textrm{ord}(\lambda )\mid q-1\). We determine the dimensions of these codes with some large
-
Constructions for t-designs and s-resolvable t-designs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-27 Tran van Trung
The purpose of the present paper is to introduce recursive methods for constructing simple t-designs, s-resolvable t-designs, and large sets of t-designs. The results turn out to be very effective for finding these objects. In particular, they reveal a fundamental property of the considered designs. Consequently, many new infinite series of simple t-designs, t-designs with s-resolutions and large sets
-
Security analysis of the ISO standard $$\textsf{OFB}$$ - $$\textsf{DRBG}$$ Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-27 Woohyuk Chung, Hwigyeom Kim, Jooyoung Lee, Yeongmin Lee
-
A survey of compositional inverses of permutation polynomials over finite fields Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-27 Qiang Wang
-
Finding orientations of supersingular elliptic curves and quaternion orders Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-26 Sarah Arpin, James Clements, Pierrick Dartois, Jonathan Komada Eriksen, Péter Kutas, Benjamin Wesolowski
-
Affine vector space partitions and spreads of quadrics Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-27 Somi Gupta, Francesco Pavese
An affine spread is a set of subspaces of \(\textrm{AG}(n, q)\) of the same dimension that partitions the points of \(\textrm{AG}(n, q)\). Equivalently, an affine spread is a set of projective subspaces of \(\textrm{PG}(n, q)\) of the same dimension which partitions the points of \(\textrm{PG}(n, q) \setminus H_{\infty }\); here \(H_{\infty }\) denotes the hyperplane at infinity of the projective closure
-
On the maximum size of variable-length non-overlapping codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-25 Geyang Wang, Qi Wang
-
The existence of $$(\mathbb {Z}_v,4,1)$$ -disjoint difference families Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-20 Xinyue Ming, Tao Feng, Guojing Jia, Xiaomiao Wang
This paper shows that a \((\mathbb {Z}_v,4,1)\)-disjoint difference family exists if and only if \(v\equiv 1\pmod {12}\) and \(v\ne 25\) by giving suitable translations of base blocks of a \((\mathbb {Z}_v,4,1)\)-cyclic difference family. The Combinatorial Nullstellensatz finds its application in constructing disjoint difference families.
-
Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-18 Isaac A. Canales-Martínez, Igor Semaev
-
New families of quaternionic Hadamard matrices Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-18 Santiago Barrera Acevedo, Heiko Dietrich, Corey Lionis
A quaternionic Hadamard matrix (QHM) of order n is an \(n\times n\) matrix H with non-zero entries in the quaternions such that \(HH^*=nI_n\), where \(I_n\) and \(H^*\) denote the identity matrix and the conjugate-transpose of H, respectively. A QHM is dephased if all the entries in its first row and first column are 1, and it is non-commutative if its entries generate a non-commutative group. The
-
Bases for Riemann–Roch spaces of linearized function fields with applications to generalized algebraic geometry codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-15 Horacio Navarro
Several applications of function fields over finite fields, or equivalently, algebraic curves over finite fields, require computing bases for Riemann–Roch spaces. In this paper, we determine explicit bases for Riemann–Roch spaces of linearized function fields, and we give a lower bound for the minimum distance of generalized algebraic geometry codes. As a consequence, we construct generalized algebraic
-
Optimal ternary locally repairable codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-13 Jie Hao, Shu-Tao Xia, Kenneth W. Shum, Bin Chen, Fang-Wei Fu, Yixian Yang
Locally repairable codes (LRCs) are linear codes with locality properties for code symbols, which have important applications in distributed storage systems. In this paper, we completely classify all the possible code parameters of optimal ternary LRCs achieving the Singleton-like bound proposed by Gopalan et al. Explicit constructions of optimal ternary LRCs are given for each group of possible code
-
Circular external difference families: construction and non-existence Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-12 Huawei Wu, Jing Yang, Keqin Feng
The circular external difference family and its strong version are of great significance both in theory and in applications. In this paper, we apply the classical cyclotomic construction to the circular external differnece family and exhibit several concrete examples, in particular constructing an infinite family. Furthermore, we prove that all strong circular external differnece families are constructed
-
An asymptotic property of quaternary additive codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-12 Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco
Let \(n_k(s)\) be the maximal length n such that a quaternary additive \([n,k,n-s]_4\)-code exists. We solve a natural asymptotic problem by determining the lim sup \(\lambda _k\) of \(n_k(s)/s\) for s going to infinity, and the smallest value of s such that \(n_k(s)/s=\lambda _k.\) Our new family of quaternary additive codes has parameters \([4^k-1,k,4^k-4^{k-1}]_4=[2^{2k}-1,k,3\cdot 2^{2k-2}]_4\)
-
On prefer-one sequences Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-10 Yupeng Jiang, Ming Li, Ying Gao, Dongdai Lin
-
External codes for multiple unicast networks via interference alignment Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-10 F. R. Kschischang, F. Manganiello, A. Ravagnani, K. Savary
-
On the classification of skew Hadamard matrices of order $$\varvec{36}$$ and related structures Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-07 Makoto Araya, Masaaki Harada, Hadi Kharaghani, Ali Mohammadian, Behruz Tayfeh-Rezaie
Two skew Hadamard matrices are considered SH-equivalent if they are similar by a signed permutation matrix. This paper determines the number of SH-inequivalent skew Hadamard matrices of order 36 for some types. We also study ternary self-dual codes and association schemes constructed from the skew Hadamard matrices of order 36.
-
Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed–Muller-type codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-05 Manuel González-Sarabia, Humberto Muñoz-George, Jorge A. Ordaz, Eduardo Sáenz-de-Cabezón, Rafael H. Villarreal
-
On the number of rational points of Artin–Schreier’s curves and hypersurfaces Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-05 F. E. Brochero Martínez, Daniela Oliveira
Let \(\mathbb {F}_{q^n}\) represent the finite field with \(q^n\) elements. In this paper, our focus is on determining the number of \(\mathbb {F}_{q^n}\)-rational points for two specific objects: an affine Artin–Schreier curve given by the equation \(y^q-y = x(x^{q^i}-x)-\lambda \), and an Artin–Schreier hypersurface given by the equation \(y^q-y=\sum _{j=1}^r a_jx_j(x_j^{q^{i_j}}-x_j)-\lambda \)
-
A note on approximate Hadamard matrices Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-06-04 Stefan Steinerberger
-
ZLR: a fast online authenticated encryption scheme achieving full security Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-30 Wonseok Choi, Seongha Hwang, Byeonghak Lee, Jooyoung Lee
-
Constructions of t-strongly multimedia IPP codes with length $$t+1$$ Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-28 Jing Jiang, Fenggui Pei, Cailin Wen, Minquan Cheng, Henk D. L. Hollmann
Strongly multimedia identifiable parent property code (t-SMIPPC) was introduced for protecting multimedia contents from illegally redistributing under the averaging collusion attack. Such a code has efficient algorithms for tracing colluders. However, there are few results about the existence of such codes up to now. In this paper, we focus on t-SMIPPCs with length \(t+1\) where \(t \ge 2\) is an integer
-
Some new constructions of optimal linear codes and alphabet-optimal $$(r,\delta )$$ -locally repairable codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-24 Jing Qiu, Fang-Wei Fu
In distributed storage systems, an r-Locally Repairable Code (r-LRC) ensures that a failed symbol can be recovered by accessing at most r other symbols. Prakash et al. in (Proceedings of IEEE International Symposium on Information Theory, pp. 2776–2780, 2012) further introduced the concept of \((r, \delta )\)-LRC, where \(\delta \ge 2\), which can deal with the symbol failure in the presence of extra
-
Structure of CSS and CSS-T quantum codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-24 Elena Berardini, Alessio Caminata, Alberto Ravagnani
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction capability, showing that such pairs are easy to produce with a randomized construction. We then prove that CSS-T codes exhibit the opposite behaviour, showing also
-
Linear codes from simplicial complexes over $${\mathbb {F}}_{2^n}$$ Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-24 Hongwei Liu, Zihao Yu
In this article we mainly study linear codes over \({\mathbb {F}}_{2^n}\) and their binary subfield codes. We construct linear codes over \({\mathbb {F}}_{2^n}\) whose defining sets are the certain subsets of \({\mathbb {F}}_{2^n}^m\) obtained from mathematical objects called simplicial complexes. We will consider simplicial complexes with one maximal element. The relation of the weights of codewords
-
Bounds on data limits for all-to-all comparison from combinatorial designs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-23 Joanne Hall, Daniel Horsley, Douglas R. Stinson
-
On duplication-free codes for disjoint or equal-length errors Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-21 Wenjun Yu, Moshe Schwartz
-
A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-21 Masaaki Harada
We introduce quaternary modified four \(\mu \)-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four \(\mu \)-circulant Hermitian self-dual codes. We also construct quaternary modified four \(\mu \)-circulant Hermitian self-dual codes having large minimum weights. Two quaternary Hermitian self-dual [56, 28, 16] codes are constructed for the
-
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-21 Muhammad Imran, Gábor Ivanyos
The semidirect discrete logarithm problem (SDLP) is the following analogue of the standard discrete logarithm problem in the semidirect product semigroup \(G\rtimes {{\,\textrm{End}\,}}(G)\) for a finite semigroup G. Given \(g\in G, \sigma \in {{\,\textrm{End}\,}}(G)\), and \(h=\prod _{i=0}^{t-1}\sigma ^i(g)\) for some integer t, the SDLP\((G,\sigma )\), for g and h, asks to determine t. As Shor’s
-
Locally maximal recoverable codes and LMR-LCD codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-17 Rajendra Prasad Rajpurohit, Maheshanand Bhaintwal, Charul Rajput
-
LCD codes and almost optimally extendable codes from self-orthogonal codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-17 Xinran Wang, Ziling Heng, Fengwei Li, Qin Yue
LCD codes and (almost) optimally extendable codes can be used to safeguard against fault injection attacks (FIA) and side-channel attacks (SCA) in the implementations of block ciphers. The first objective of this paper is to use a family of binary self-orthogonal codes given by Ding and Tang (Cryptogr Commun 12:1011–1033, 2020) to construct a family of binary LCD codes with new parameters. The parameters
-
On optimal constant weight codes derived from $$\omega $$ -circulant balanced generalized weighing matrices Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-14 Hadi Kharaghani, Thomas Pender, Vladimir Tonchev
Balanced generalized weight matrices are used to construct optimal constant weight codes that are monomially inequivalent to codes derived from the classical simplex codes. What’s more, these codes can be assumed to be generated entirely by \(\omega \)-shifts of a single codeword where \(\omega \) is a primitive element of a Galois field. Additional constant weight codes are derived by projecting onto
-
Lifting iso-dual algebraic geometry codes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-07 María Chara, Ricardo Podestá, Luciane Quoos, Ricardo Toledano
-
Yoyo attack on 4-round Lai-Massey scheme with secret round functions Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-03 Le Dong, Danxun Zhang, Wenya Li, Wenling Wu
-
Characterization of weakly regular p-ary bent functions of $$\ell $$ -form Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-02 Jong Yoon Hyun, Jungyun Lee, Yoonjin Lee
We study the essential properties of weakly regular p-ary bent functions of \(\ell \)-form, where a p-ary function is from \(\mathbb {F}_{p^m}\) to \(\mathbb {F}_p\). We observe that most of studies on a weakly regular p-ary bent function f with \(f(0)=0\) of \(\ell \)-form always assume the gcd-condition: \(\gcd (\ell -1,p-1)=1\). We first show that whenever considering weakly regular p-ary bent functions
-
Computing gluing and splitting $$(\ell ,\ell )$$ -isogenies Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-02 Song Tian
-
Optimal $$(r,\delta )$$ -LRCs from monomial-Cartesian codes and their subfield-subcodes Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-05-02 C. Galindo, F. Hernando, H. Martín-Cruz
-
On the packing density of Lee spheres Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-30 Ang Xiao, Yue Zhou
-
Special directions on the finite affine plane Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-29 Gergely Kiss, Gábor Somlai
-
Subgroup total perfect codes in Cayley sum graphs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-29 Xiaomeng Wang, Lina Wei, Shou-Jun Xu, Sanming Zhou
Let \(\Gamma \) be a graph with vertex set V, and let a, b be nonnegative integers. An (a, b)-regular set in \(\Gamma \) is a nonempty proper subset D of V such that every vertex in D has exactly a neighbours in D and every vertex in \(V \setminus D\) has exactly b neighbours in D. In particular, a (1, 1)-regular set is called a total perfect code. Let G be a finite group and S a square-free subset
-
Small weight codewords of projective geometric codes II Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-28 Sam Adriaensen, Lins Denaux
The \(p\)-ary linear code \(\mathcal {C}_{k}\!\left( n,q\right) \) is defined as the row space of the incidence matrix \(A\) of \(k\)-spaces and points of \(\textrm{PG}\!\left( n,q\right) \). It is known that if \(q\) is square, a codeword of weight \(q^k\sqrt{q}+\mathcal {O}\!\left( q^{k-1}\right) \) exists that cannot be written as a linear combination of at most \(\sqrt{q}\) rows of \(A\). Over
-
Further results on covering codes with radius R and codimension $$tR+1$$ Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-27 Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco
The length function \(\ell _q(r,R)\) is the smallest possible length n of a q-ary linear \([n,n-r]_qR\) code with codimension (redundancy) r and covering radius R. Let \(s_q(N,\rho )\) be the smallest size of a \(\rho \)-saturating set in the projective space \(\textrm{PG}(N,q)\). There is a one-to-one correspondence between \([n,n-r]_qR\) codes and \((R-1)\)-saturating n-sets in \(\textrm{PG}(r-1
-
Using $$P_\tau $$ property for designing bent functions provably outside the completed Maiorana–McFarland class Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-22 Enes Pasalic, Amar Bapić, Fengrong Zhang, Yongzhuang Wei
In this article, we identify certain instances of bent functions, constructed using the so-called \(P_\tau \) property, that are provably outside the completed Maiorana–McFarland (\({\mathcal{M}\mathcal{M}}^\#\)) class. This also partially answers an open problem in posed by Kan et al. (IEEE Trans Inf Theory, https://doi.org/10.1109/TIT.2022.3140180, 2022). We show that this design framework (using
-
Chain-imprimitive, flag-transitive 2-designs Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-20 Carmen Amarra, Alice Devillers, Cheryl E. Praeger
We consider 2-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on 2-designs which are block-transitive but not necessarily flag-transitive. In particular we use the concept of the “array” of a point subset with respect to the chain of point-partitions; the array describes the distribution of
-
Meet-in-the-middle attacks on AES with value constraints Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-18 Xiaoli Dong, Jun Liu, Yongzhuang Wei, Wen Gao, Jie Chen
-
Symmetric 2-adic complexity of Tang–Gong interleaved sequences from generalized GMW sequence pair Des. Codes Cryptogr. (IF 1.4) Pub Date : 2024-04-16 Bo Yang, Kangkang He, Xiangyong Zeng, Zibi Xiao
Tang–Gong interleaved sequences constructed from the generalized GMW sequence pair are a class of binary sequences with optimal autocorrelation magnitude. In this paper, the symmetric 2-adic complexity of these sequences is investigated. We first derive a lower bound on their 2-adic complexity by extending the method proposed by Hu. Then, by analysing the algebraic structure of these sequences, a lower