Designs, Codes and Cryptography
Издатель: Springer Nature · ISSN 0925-1022,1573-7586 · 429 статей
- Internal differential structure: preimage attacks on up to 5-round Keccak
- Improved method of searching for boomerang distinguishers on Feistel structures–applications to WARP, TWINE, LBlock, LBlock-s, and ALLPC
-
Evolving secret sharing revisited: computational security and succinctness
Abstract Evolving secret sharing (Komargodski, Naor, and Yogev, TCC’16) generalizes the notion of secret sharing to the setting of evolving access structures , in which the share holders are added to the system in an online manner, and...
- On the clique covering numbers of Johnson graphs
- Optimizing and securing GLV multiplication over BLS pairings-friendly curves
- Differential uniformity and constacyclic code from some power mapping
-
About the Rankin and Bergé-Martinet constants from a coding theory view point
Abstract The Rankin constant $$\gamma _{n,l}$$ γ n , l measures the largest volume of the densest sublattice of rank l of a lattice $$\Lambda \in {\mathbb {R}}^n$$ Λ ∈ R n over all such lattices of rank n . The Bergé-Martinet constant...
- A class of locally recoverable codes over finite chain rings
-
Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals
Abstract It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals...
-
Improvements for lower bounds of mutually orthogonal Latin squares of sizes 54, 96 and 108
Abstract In this paper, respectively 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of sizes $$n=54$$ n = 54 , 96 and 108 are obtained (previously, only 5, 9 and 8 MOLS were respectively known for these values). The cases $$n=54$$...
- Hilbert series and degrees of regularity of Oil & Vinegar and mixed quadratic systems
-
(k, n)-Consecutive access structures
Abstract We consider access structures over a set of n participants, defined by a parameter k with $$1 \le k \le n$$ 1 ≤ k ≤ n in the following way: a subset is authorized if it contains at least k consecutive participants. Depending on...
- Self-reversible generalized (L,G)-codes
-
Primitive rank 3 groups, binary codes, and 3-designs
Abstract Let G be a primitive rank 3 permutation group acting on a set of size v . Binary codes of length v globally invariant under G are well-known to hold PBIBDs in their $$A_w$$ A w codewords of weight w . The parameters of these...
-
Information-set decoding for convolutional codes
Abstract In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use convolutional codes as public keys. We then apply this framework to...
-
More on codes for combinatorial composite DNA
Abstract In this paper, we focus on constructing unique-decodable and list-decodable codes for the recently studied ( t , e )-composite-asymmetric error-correcting codes (( t , e )-CAECCs). Let $$\mathcal {X}$$ X be an $$m \times n$$ m...
- A combinatorial approach to avoiding weak keys in the BIKE cryptosystem
-
Evaluation codes arising from symmetric polynomials
Abstract Datta and Johnsen (Des Codes Cryptogr 91:747–761, 2023) introduced a new family of evaluation codes in an affine space of dimension $$\ge 2$$ ≥ 2 over a finite field $${\mathbb {F}}_q$$ F q where linear combinations of...
- On tweakable correlation robust hashing against key leakages
- On flag-transitive symmetric (v, k, 4) designs
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
-
Commutative cryptanalysis as a generalization of differential cryptanalysis
Abstract 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$$ ( E k ) k of permutations on a finite vector space G ,...
-
On the coding capacity of reverse-complement and palindromic duplication-correcting codes
Abstract 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...
- Trace representation of a family of generalized cyclotomic binary sequences with period $$p^n$$
- Avoiding trusted setup in isogeny-based commitments
- Lattice codes for CRYSTALS-Kyber
- Weak colourings of Kirkman triple systems
- Rational transformations over finite fields that are never irreducible
-
Permutations minimizing the number of collinear triples
Abstract We characterize the permutations of $$\mathbb {F}_q$$ 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...
- Coding properties and automorphism groups of two classes of twisted generalized Reed–Solomon codes