Designs, Codes and Cryptography
Издатель: Springer Nature · ISSN 0925-1022,1573-7586 · 429 статей
- Analysis of some classes of bent partitions and vectorial bent functions
- Infinite families of linear codes over finite fields with new parameters and their hull dimensions
-
The matrix subcode equivalence problem and its application to signature with MPC-in-the-head
Abstract Nowadays, equivalence problems are widely used in cryptography, most notably to establish cryptosystems such as digital signatures, with MEDS, LESS, PERK as the most recent ones. However, in the context of matrix codes, only...
- Cryptanalysis of a multivariate CCZ scheme
- When arcs extend uniquely: a higher-dimensional generalization of Barlotti’s result
-
The complexity of the SupportMinors Modeling for the MinRank Problem
Abstract In this note, we provide proven estimates for the complexity of the SupportMinors Modeling, mostly confirming the heuristic complexity estimates contained in the original article (Bardet (2020) Improvements of algebraic attacks...
- Constructing optimal linear codes for code-based masking schemes of higher-orders
- Determining the exact value of the second-order generalized covering radius of two classes of binary cyclic codes
-
On the number of minimal and next-to-minimal weight codewords of toric codes over hypersimplices
Abstract Toric codes are a type of evaluation code introduced by J.P. Hansen in 2000. They are produced by evaluating (a vector space composed of) polynomials at the points of $$(\mathbb {F}_q^*)^s$$ ( F q ∗ ) s , the monomials of these...
- Editorial: WCC 2024—Workshop on coding and cryptography
- Polygonal triples
- A tight upper bound on the number of nonzero weights of a quasi-cyclic code
- Possible values for the nonlinearity of de bruijn feedback functions
- Authorized multi-key fully homomorphic encryption scheme with compact ciphertext
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Alphabet-affine 2-neighbour-transitive codes
- Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal
- Learning with errors over group rings constructed by semi-direct product
- FE for inner products and its application to multi-authority ABE
- Concrete analysis of Schnorr-type signatures with aborts
- Locally recoverable algebro-geometric codes from projective bundles
- Hull parameters of Projective Reed–Muller codes
- A linearisation method for identifying dependencies in differential characteristics: examining the intersection of deterministic linear relations and nonlinear constraints
- Improved preimage attacks on round-reduced Keccak-384/512
- Security analysis of the P-SPN structure with a class of linear layer matrix against invariant subspace attack
-
The second minimum size of a finite subspace partition
Abstract Let $$V=V(d,q)$$ V = V ( d , q ) denote the vector space of dimension d over $${\mathbb F}_q$$ F q . A subspace partition $$\mathcal {P}$$ P of V , also known as a vector space partition , is a collection of nonempty subspaces...
- Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
-
Considerate ramp secret sharing
Abstract In this work we revisit the fundamental findings by Chen et al. (in: Advances in Cryptology—EUROCRYPT 2007. Lecture Notes in Computer Science, Springer, Berlin, 2007) on general information transfer in linear ramp secret...
- Multi-orbit cyclic subspace codes via direct sum of Sidon spaces
- On the complexity formulae of the number field sieve and its variants