Designs, Codes and Cryptography
Publisher: Springer Nature · ISSN 0925-1022,1573-7586 · 429 articles
- Two-key variant of the four-round cascading $$\textsf{LRW1}$$
- Coxeter codes: extending the Reed–Muller family
- Large domain homomorphic evaluation for BFV-like schemes via ring repacking
- Optimizing key recovery in impossible cryptanalysis and its automated tool
- Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
- On the ability to approximate k-DSP of HKZ, BKZ and Slide reduction
-
Group factorisation for smaller signatures from cryptographic group actions
Abstract Cryptographic group actions have gained significant attention in recent years for their application on post-quantum Sigma protocols and digital signatures. In NIST’s recent additional call for post-quantum signatures, three...
- Spread codes from Abelian non-cyclic groups
- Block-primitive 2-$$(v,k,\lambda )$$ designs with sporadic socle
- Sequence of numbers of linear codes with increasing hull dimensions
- Research on constructing integral distinguishers for block ciphers via the division property
- Differential-linear attacks from new distinguishers
- Linear complete symmetric rank-distance codes
- Multisets with few special directions and small weight codewords in desarguesian planes
- Ternary self-orthogonal codes from square functions
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
-
Quasi-optimal cyclic orbit codes
Abstract We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the cyclic orbit code generated by a subspace U of $${{\mathbb...
- Large sets of Desargues configurations
- Maximum number of points of intersection of a non-degenerate Hermitian variety and a cubic hypersurface
- Some three-weight linear codes and their complete weight enumerators and weight hierarchies
- On certain blocking sets and the minimum weight of the code of generalised polygons
- On the systems of Higman
- PAORE: public-key authenticated order-revealing encryption
- Weight distributions of two classes of optimal $$(r{,}\delta )$$-locally repairable codes
- Multi-splitting forking based modular security of signatures in multivariate quadratic setting
- Improved bounds for codes over trees
- Improved preimage attacks on Ascon-XOF based on linearization technique
- Characterization of some minihypers in $${{\,\textrm{PG}\,}}(r,3)$$ and the nonexistence of some ternary Griesmer codes
- Packing designs with large block size
-
Intersective sets over abelian groups
Abstract Given a finite abelian group G and a subset $$J\subset G$$ J ⊂ G with $$0\in J$$ 0 ∈ J , let $$D_{G}(J,N)$$ D G ( J , N ) be the maximum size of $$A\subset G^{N}$$ A ⊂ G N such that the difference set $$A-A$$ A - A and...