Designs, Codes and Cryptography
Издатель: Springer Nature · ISSN 0925-1022,1573-7586 · 429 статей
- On flag-transitive 2-designs with prime block length and projective special linear groups
- New construction of non-expandable (1, k)-overlap-free codes
-
Information set decoding for ring-linear codes
Abstract Information set decoding (ISD) algorithms currently offer the most powerful tool to solve the two archetypal problems of coding theory, namely the codeword finding problem and the syndrome decoding problem. Traditionally, ISD...
- Optimal CIS codes, optimal t-CIS codes and their applications in cryptography
-
Sneaking up the ranks: Partial key exposure attacks on rank-based schemes
Abstract A partial key exposure attack is a key recovery attack where an adversary obtains a priori partial knowledge of the secret key, e.g., through side-channel leakage. While for a long time post-quantum cryptosystems, unlike RSA,...
- On Eisenstein additive codes over chain rings and linear codes over mixed alphabets
- Binary duadic codes and their related codes with a square-root-like lower bound
- On construction of linear (Euclidean) hull codes over finite extensions binary fields
- A new method for constructing designs and codes from the conjugacy classes of groups
- Generalized indifferentiable sponge and its application to Polygon Miden VM
-
MDS stabilizer poset codes
Abstract Poset metrics in the context of stabilizer codes are investigated. We establish a Singleton-type bound for stabilizer poset codes and introduce the notion of MDS stabilizer poset codes. Several characterizations of these codes...
- Lemmas on traceability codes and an upper bound for 4-traceability
- Construction of correctors using resilient fragmentary Boolean functions
- Biextensions in pairing-based cryptography
- On flag-transitive quasi-symmetric 2-designs
-
Extensible decentralized secret sharing and application to Schnorr signatures
Abstract Starting from links between Coding Theory and Secret Sharing Schemes, we develop an extensible and decentralized version of Shamir Secret Sharing, that allows the addition of new users after the initial share distribution. On...
- NTRU+Sign: compact NTRU-based signatures using bimodal distributions
- Simulation secure multi-input quadratic functional encryption: applications to differential privacy
- Ryser’s theorem for simple multi-Latin rectangles
- Selfdual skew cyclic codes
-
The existence of pyramidal Steiner triple systems over abelian groups
Abstract A Steiner triple system STS( v ) is called f -pyramidal if it has an automorphism group fixing f points and acting sharply transitively on the remaining $$v-f$$ v - f points. In this paper, we focus on the STSs that are f...
- Semiregular relative difference sets related to Gauss sums and projective planes
-
Constructions of covering sequences and 2D-sequences
Abstract An ( n , R )-covering sequence is a cyclic sequence whose consecutive n -tuples form a code of length n and covering radius R . Using several construction methods improvements of the upper bounds on the length of such sequences...
- New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
- The homogeneous pseudo-embeddings of $$\textrm{PG}(2,8)$$
- Surface and color codes from semi-regular tessellations on non-orientable surfaces
- Several new classes of MDS symbol-pair codes
- The expectation and the variance of the weights of de Bruijn sequences
-
Linear codes in the folded Hamming distance and the quasi MDS property
Abstract In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting...
- Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product