Cryptography and Communications
Издатель: Springer Nature · ISSN 1936-2447,1936-2455 · 165 статей
- Multiple spectrally null constrained complete complementary codes of various lengths over small alphabet
- Distinctness of the lifted kloosterman sums on the prime field $$\mathbb {F}_p,\; p> 3$$
- An Improved Threshold Homomorphic Cryptosystem Based on Class Groups
- The weight distributions of three new classes of binary linear codes
-
Further existence results of decompositions of permutation polynomials
Abstract When permutation polynomials over finite fields are used as core components of cryptographic algorithms, one step in reducing the hardware area of their secure implementation is to represent them as a composition of permutation...
-
New quantum MDS codes with flexible parameters from Hermitian self-orthogonal GRS codes
Abstract Let q be a prime power. Let $$\lambda >1$$ λ > 1 be a divisor of $$q-1$$ q - 1 and $$\tau >1$$ τ > 1 be a divisor of $$q+1$$ q + 1 . Under certain conditions we prove that there exists an MDS stabilizer quantum code with length...
-
Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs
Abstract We instantiate the hash-then-evaluate paradigm for pseudorandom functions (PRFs), $$\textsf{PRF}(k,x):=\textsf{wPRF}(k,\textsf{RO}(x))$$ PRF ( k , x ) : = wPRF ( k , RO ( x ) ) , which builds a PRF $$\textsf{PRF}$$ PRF from a...
-
Pattern sets for $$\mathbb {F}_q$$-sequences invariant under the continued fraction operator K (the Berlekamp-Massey algorithm)
Abstract We show that for all infinite sequences $$s\in \mathbb {F}_q^\omega $$ s ∈ F q ω , two properties are preserved under forward and backward application of the continued fraction operator K (the modified Berlekamp-Massey...
- New Turyn-type sequences
- Preface to the special collection on security and cryptography for networks
-
Proofs of sequential communication delays from physical assumptions and their applications
Abstract Time-based cryptographic primitives unlock efficient realizations of several functionalities including Randomness Beacons, Proof of Replicated Storage, Encryption to the Future, and MultiParty Computation with partial fairness....
- Hybrid zero-knowledge from garbled circuits
-
A computational approach for the study of linear complexity of shrunken sequences
Abstract The shrinking generator is a pseudorandom bit generator based on the combination of two linear feedback shift registers of maximum period. These registers are synchronized with a common clock and produce binary sequences with...
- The locally crooked permutations and the complete permutations over $$\mathbb {F}_{2^{n}}$$
-
LR-OT: Leakage-resilient oblivious transfer
Abstract Oblivious Transfer ( $$\textsf{OT}$$ OT ) is a fundamental cryptographic primitive that becomes a crucial component of a practical secure protocol. $$\textsf{OT}$$ OT is typically implemented in software, and one way to...
- Several classes of permutation polynomials over $$\mathbb {F}_{p^{2m}}$$ with odd characteristic based on the AGW criterion
-
On the minimum Hamming distance between vectorial Boolean and affine functions
Abstract In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the nonlinearity and differential uniformity of vectorial functions, while its...
- Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
- Several classes of optimal quinary cyclic codes with minimum distance four
- A proof of a conjecture on permutation trinomials
- New constructions on self-dual algebraic geometry codes
- New successor rules to efficiently produce exponentially many binary de Bruijn sequences
- Lower bounds on the aperiodic Hamming correlation of low hit zone frequency hopping sequence sets with gaps
- Some geometric constructions of optimal frequency hopping sequences
- Double cyclic codes over $$ \aleph =\bigoplus _{i=0}^{n} \zeta ^{i}\mathbb {Z}_{2} $$, with $$ \zeta ^{n}=0 $$
- BCH codes with explicit minimum distance and applications in quantum synchronizable codes
- On binomial Weil sums and an application
- An infinite family of binary cyclic codes and two infinite families of ternary cyclic codes with good parameters
- Generator polynomials of cyclic expurgated or extended Goppa codes with odd characteristic
- On the solutions of $$ X^{q^2}+aX^q+bX=c $$ over $$ {\mathbb {F}}_{2^{n}} $$