Cryptography and Communications
Publisher: Springer Nature · ISSN 1936-2447,1936-2455 · 165 articles
-
Subspace differential uniformity
Abstract The main contribution of this paper is to introduce Subspace Differential Uniformity (SDU) for S-boxes and block ciphers. The SDU is essentially a measure of how well any function spreads input differences clustered in affine...
- The sequence reconstruction of permutations under hamming metric with small errors
- Several classes of linear codes with at most six weights and their secret sharing schemes
- Improved parallel linkage construction of constant dimension codes via mixed dimension method
-
On the differential uniformity of polynomials over Galois rings
Abstract Design of hash functions and pseudo-random permutations over Galois extensions of $$\mathbb {Z}_{\varvec{q}}$$ for prime powers $$\varvec{q}$$ has recently gained some interest in relation to recent directions in advanced...
- A new construction of self-orthogonal cyclic codes
- Expanding self-orthogonal codes over a ring $$\mathbb {Z}_4$$ to self-dual codes and unimodular lattices
- Extremal self-dual codes up to length 44 and LCD codes from double circulant constructions
- Locally recoverable codes with multiple recovering sets from maximal curves
- Constructions of two-dimensional complete complementary codes with flexible array sizes
- A classification of invariant sets of constant-weight tuples and applications to covering schemes
- Locally repairable codes and minimal codes by homogenization of down-sets
-
Property-preserving hashing for $$\ell _1$$-distance predicates: Applications to countering adversarial input attacks
Abstract Perceptual hashing is widely used to detect whether an input image is similar to a reference image with a variety of security applications. Recently, it has been shown to succumb to adversarial input attacks which make small...
-
Post-quantum (partially) blind signatures from matrix code equivalence
Abstract We construct a novel code-based blind signature scheme, using the MEDS group action. The scheme is built using similar ideas to the Schnorr blind signature scheme and CSI-Otter, but uses additional public key and commitment...
- RedHAWK: Reducing HAWK digital signature stored signing keys
- Conjugate coding based designated verifier quantum zero knowledge proof for user authentication
- HM-AKA+: Protecting against a semi-trusted third party with Hybrid Crypto
-
Cyclic $$(r,\delta )$$ locally recoverable codes from their constacyclic and negacyclic subcodes
Abstract If a symbol in any coordinate of a codeword in a code $$\mathcal {C}$$ can be repaired by accessing at most r other coordinates, then the positive integer r is called locality of the code. Codes with locality are called locally...
- Pseudo-random number generators based on quartic vectorial FCSR
- Non-existence of infinite APN families from patched monomials in odd characteristic
- Attribute-based quantum broadcast encryption with composite policies via symmetric unitary $$t$$-designs
- Low ambiguity zone property of generalized chirp-like sequences under fractional doppler
- Weak keys in QC-MDPC-based cryptosystems via the extended euclidean algorithm
- On the construction of ultra-light MDS matrices
- Constructions of $$\bar{3}$$-separable codes with length 4
-
Polynomial lattices for the BIKE cryptosystem
Abstract In this paper we introduce a rank $$\varvec{2}$$ lattice over a polynomial ring arising from the public key of the BIKE cryptosystem (2024). The secret key is a sparse vector in this lattice. We study properties of this lattice...
- VOLE-in-the-head signatures based on the linear code equivalence problem
- MDS and NMDS codes from extended codes of extended twisted Reed-Solomon codes
- Locally maximal recoverable codes with unequal localities and LMR codes with hierarchical locality
- New construction of cyclic subspace codes via Sidon spaces