Cryptography and Communications
Издатель: Springer Nature · ISSN 1936-2447,1936-2455 · 165 статей
- New constructions of MDP convolutional codes with memory 1 for $$\varvec{k=2,3}$$
- The existence of perfect $$(n\times m, 3, 2, 1)$$-geometric orthogonal codes
- Hull dimension of optimal binary LRCs with availability
- Construction of two-dimensional complementary array code sets with flexible array sizes
- The relation between two constructions of permutation polynomials over $$\mathbb {F}_{q^n}$$
-
Hardware acceleration of the LESS canonical form computation
Abstract LESS is a round 2 candidate of the onramp digital signature competition currently being organized by NIST. Recent work related to LESS introduced the notion of canonical forms, which enable substantially reduced signature sizes...
-
Asymptotic performance of double circulant and four circulant codes with small hull dimension
Abstract We present enumeration formulas for double circulant (DC) codes of length $$2m$$ and four circulant (FC) codes of length $$4m$$ over the finite field $$\mathbb {F}_q$$ , with prescribed Euclidean hull dimension, assuming $$\gcd...
- Can we speed up information set decoding by using extension field structure?
- $$(1+\epsilon )$$-optimal MDS codes: contacting any set of helper nodes smaller than $$n-1$$
- Preface for SEquences and Their Applications SETA 2024
- RW-9: A family of random walk tests
-
Designing bent functions using the Maiorana-McFarland secondary construction
Abstract Given a bent function of dimension $$s-r$$ , we apply the Maiorana-McFarland secondary construction to produce a new bent function of dimension $$s+r$$ . Throughout this process, we consider affine spaces, since bent functions...
- Advanced 8 × 8 circulant MDS matrices and key-dependent AES enhancement
- A class of ternary LCD cyclic codes
- Optimal array codes with hierarchical locality
- Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes
-
Testing generalized affine equivalence and applications to the classification of GAPN functions
Abstract For functions over the finite field $$\mathbb {F}_{p^n}$$ , we study a generalization of affine equivalence. Two functions of algebraic degree d are equivalent if, when ignoring monomials of algebraic degree $$d-1$$ or less,...
-
Pushing the QAM method for finding APN functions further
Abstract APN functions offer optimal resistance to differential attacks and are instrumental in the design of block ciphers in cryptography. While finding APN functions is very difficult in general, a promising way to construct APN...
-
Shift-invariant transformations and almost liftings
Abstract We investigate shift-invariant transformations, also known as rotation-symmetric vectorial Boolean functions, on n bits that are induced from Boolean functions on k bits, for $$k\le n$$ . We consider such transformations that...
-
Bounds for the average degree-k monomial density of Boolean functions
Abstract In cryptographic applications, Boolean functions are typically represented in algebraic normal form, i.e. as multivariate polynomial functions over the finite field $${\mathbb {F}}_2$$ . For such a function $$f$$ , we consider,...
- A generalized approach to root-based attacks against PLWE
- Distributed repairing multiple erasures in Reed-Solomon codes
-
Quantum stabiliser codes via concatenation of idempotents in commutative group algebras
Abstract Group algebras offer a rich algebraic perspective for the study of classical codes. Through this lens, idempotents have been shown to characterise properties of their associated classical codes. However, attempts to extend the...
-
CCA-attacks on lattice-based encryption-decryption schemes
Abstract This paper presents two distinct chosen-ciphertext attacks (CCA) against lattice-based encryption and decryption schemes, in particular based on the LWE problem, a class of post-quantum cryptographic algorithms. First we attack...
- Odd-periodic low/zero ambiguity zone: Theoretical Bounds and Optimal Constructions
- Explicit constructions of optimal vector locally repairable codes
- Generalized Boolean functions over Galois rings
- On $$\ell$$-dimensional linear intersection pairs of algebraic geometry codes
- Several classes of optimal ternary cyclic codes with two zeros
- New construction of complete complementary codes with low PAPR for column sequences