Designs, Codes and Cryptography最新文献

In this paper, we study nontrivial symmetric (v, k, 4) designs admitting a flag-transitive and point-primitive affine automorphism group. In conclusion, all symmetric (v, k, 4) designs admitting flag-transitive automorphism groups are known apart from those admitting one-dimensional automorphisms, and hence the classification of flag-transitive symmetric (v, k, 4) designs reduces to the case of one-dimensional affine automorphism groups.

Recently, Baudrin et al. analyzed a special case of Wagner’s commutative diagram cryptanalysis, referred to as commutative cryptanalysis. For a family ((E_k)_k) of permutations on a finite vector space G, commutative cryptanalysis exploits the existence of affine permutations (A,B :G rightarrow G), (I notin {A,B}) such that (E_k circ A (x) = B circ E_k(x)) holds with high probability, taken over inputs x, for a significantly large set of weak keys k. Several attacks against symmetric cryptographic primitives can be formulated within the framework of commutative cryptanalysis, most importantly differential attacks, as well as rotational and rotational-differential attacks. Besides, the notion of c-differentials on S-boxes can be analyzed as a special case within this framework. We discuss the relations between a general notion of commutative cryptanalysis, with A and B being arbitrary functions over a finite Abelian group, and differential cryptanalysis, both from the view of conducting an attack on a symmetric cryptographic primitive, as well as from the view of a theoretical study of cryptographic S-boxes.

We derive the coding capacity for duplication-correcting codes capable of correcting any number of duplications. We do so both for reverse-complement duplications, as well as palindromic (reverse) duplications. We show that except for duplication-length 1, the coding capacity is 0. When the duplication length is 1, the coding capacity depends on the alphabet size, and we construct optimal codes.

The concept of minimal linear codes was introduced by Ashikhmin and Barg in 1998, leading to the development of various methods for constructing these codes over finite fields. In this context, minimality is defined as a codeword u in a linear code (mathcal {C}) is considered minimal if u covers the codeword cu for all c in the finite field (mathbb {F}_{q}) of order q but no other codewords in (mathcal {C}). A linear code (mathcal {C}) is said to be minimal if each of its codewords is minimal. Minimal codewords are widely used in decoding linear codes, secret sharing schemes, secure two-party computations, cryptography, and other areas such as combinatorics. They have also facilitated the exploration of codes and research codes over finite commutative rings, which are considered appropriate alphabets for coding theory. Extending the minimality property from finite fields to rings and developing such codes poses significant challenges but presents opportunities for advancing coding theory in the context of finite rings. Firstly, the aim is to create graphs that produce a linear minimal (or nearly minimal) code through their adjacency, and examples will be offered for explicit illustrations. Secondly, there is an investigation of codes over rings generated by minimal codewords and an exploration of related minimal codes over finite chain rings. More specifically, a basis (mathcal {C}) is constructed so that every codeword is minimal. To this end, a linear transformation of (mathcal {C}) with this basis is built, and sufficient and necessary minimal linear codes over finite chain rings are provided. Then, there is a new design of minimality conditions over finite principal ideal rings.

The trace representation of sequences is useful for implementing the generator of sequences and analyzing their cryptographic properties. In this paper, we focus on investigating the trace representation for a family of generalized cyclotomic binary sequences with period (p^n). On the basis of the properties of the generalized cyclotomic classes, a trace representation of this family of sequences is obtained by computing the discrete Fourier transform of the sequences, whenever p is a non-Wieferich prime. In addition, a known result on the linear complexity for this family of sequences is derived from its trace representation.

In 2021, Sterner proposed a commitment scheme based on supersingular isogenies. For this scheme to be binding, one relies on a trusted party to generate a starting supersingular elliptic curve of unknown endomorphism ring. In fact, the knowledge of the endomorphism ring allows one to compute an endomorphism of degree a power of a given small prime. Such an endomorphism can then be split into two to obtain two different messages with the same commitment. This is the reason why one needs a curve of unknown endomorphism ring, and the only known way to generate such supersingular curves is to rely on a trusted party or on some expensive multiparty computation. We observe that if the degree of the endomorphism in play is well chosen, then the knowledge of the endomorphism ring is not sufficient to efficiently compute such an endomorphism and in some particular cases, one can even prove that endomorphism of a certain degree do not exist. Leveraging these observations, we adapt Sterner’s commitment scheme in such a way that the endomorphism ring of the starting curve can be known and public. This allows us to obtain isogeny-based commitment schemes which can be instantiated without trusted setup requirements.

A (delta )-colouring of the point set of a block design is said to be weak if no block is monochromatic. The chromatic number (chi (S)) of a block design S is the smallest integer (delta ) such that S has a weak (delta )-colouring. It has previously been shown that any Steiner triple system has chromatic number at least 3 and that for each (vequiv 1) or (3pmod {6}) there exists a Steiner triple system on v points that has chromatic number 3. Moreover, for each integer (delta geqslant 3) there exist infinitely many Steiner triple systems with chromatic number (delta ). We consider colourings of the subclass of Steiner triple systems which are resolvable. A Kirkman triple system consists of a resolvable Steiner triple system together with a partition of its blocks into parallel classes. We show that for each (vequiv 3pmod {6}) there exists a Kirkman triple system on v points with chromatic number 3. We also show that for each integer (delta geqslant 3), there exist infinitely many Kirkman triple systems with chromatic number (delta ). We close with several open problems.

This paper describes a constant-time lattice encoder for the National Institute of Standards and Technology (NIST) recommended post-quantum encryption algorithm: Kyber. The first main contribution of this paper is to refine the analysis of Kyber decoding noise and prove that Kyber decoding noise can be bounded by a sphere. This result shows that the Kyber encoding problem is essentially a sphere packing in a hypercube. The original Kyber encoder uses the integer lattice for sphere packing purposes, which is far from optimal. Our second main contribution is to construct optimal lattice codes to ensure denser packing and a lower decryption failure rate (DFR). Given the same ciphertext size as the original Kyber, the proposed lattice encoder enjoys a larger decoding radius, and is able to encode much more information bits. This way we achieve a decrease of the communication cost by up to (32.6%), and a reduction of the DFR by a factor of up to (2^{85}). Given the same plaintext size as the original Kyber, e.g., 256 bits, we propose a bit-interleaved coded modulation (BICM) approach, which combines a BCH code and the proposed lattice encoder. The proposed BICM scheme significantly reduces the DFR of Kyber, thus enabling further compression of the ciphertext. Compared with the original Kyber encoder, the communication cost is reduced by (24.49%), while the DFR is decreased by a factor of (2^{39}). The proposed encoding scheme is a constant-time algorithm, thus resistant against the timing side-channel attacks.

Rational transformations play an important role in the construction of irreducible polynomials over finite fields. Usually, the methods involve fixing a rational function Q and deriving conditions on polynomials (Fin mathbb {F}_q[x]) such that the rational transformation of F with Q is irreducible. Here we want to change the perspective and study rational functions with which the rational transformation never yields irreducible polynomials. We show that if the rational function is contained in certain subfields of (mathbb {F}_q(x)) then the rational transformation with it is always reducible. This extends the list of known examples.

We characterize the permutations of (mathbb {F}_q) whose graph minimizes the number of collinear triples and describe the lexicographically-least one, confirming a conjecture of Cooper-Solymosi. This question is connected to Dudeney’s No-3-in-a-Line problem, the Heilbronn triangle problem, and the structure of finite plane Kakeya sets. We discuss a connection with complete sets of mutually orthogonal latin squares and state a few open problems primarily about general finite affine planes.