Provable security against generic attacks on stream ciphers
Journal of Mathematical Cryptology, 2023 Recent lightweight hardware-based stream cipher designs keep an external non-volatile internal state that is not part of the cipher’s hardware module. The purpose of these so-called small-state ciphers is to keep the size of the hardware and the power ...
Moch Alexander
doaj +1 more source
Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
Open Mathematics, 2020 In 2006, Hubert, Mauduit and Sárközy extended the notion of binary sequences to n-dimensional binary lattices and introduced the measures of pseudorandomness of binary lattices.
Chen Xiaolin
doaj +1 more source
Barker sequences of odd length [PDF]
, 2015 A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are at most 1 in magnitude. An old conjecture due to Turyn asserts that there is no Barker sequence of length greater than 13.
Schmidt, Kai-Uwe, Willms, Jürgen
core +1 more source
On the k-error linear complexity of cyclotomic sequences [PDF]
, 2007 Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall's sextic residue
Hassan, Aly +2 more
core +1 more source
Remarks on a cyclotomic sequence [PDF]
, 2008 We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al. (IEEE Trans Inforem Theory 51: 1849-1853, 2005).
Meidl, Wilfried
core +2 more sources
Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
Open Mathematics, 2018 Decimation-based sequence generators are a class of non-linear cryptographic generators designed to be used in hardware implementations. An inherent characteristic of such generators is that their output sequences are interleaved sequences.
Cardell Sara D. +2 more
doaj +1 more source
Remarks on the k-error linear complexity of p(n)-periodic sequences [PDF]
, 2007 Recently the first author presented exact formulas for the number of 2ⁿn-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error ...
AGB Lauder +11 more
core +1 more source
How to determine linear complexity and $k$-error linear complexity in some classes of linear recurring sequences [PDF]
, 2008 Several fast algorithms for the determination of the linear complexity of $d$-periodic sequences over a finite field $\F_q$, i.e. sequences with characteristic polynomial $f(x) = x^d-1$, have been proposed in the literature. In this contribution fast
A. Salagean +20 more
core +2 more sources
Direct sums of balanced functions, perfect nonlinear functions, and orthogonal cocycles [PDF]
, 2008 Determining if a direct sum of functions inherits nonlinearity properties from its direct summands is a subtle problem. Here, we correct a statement by Nyberg on inheritance of balance and we use a connection between balanced derivatives and orthogonal ...
Horadam, K, LeBel, A
core +1 more source
Estudio de algunas Secuencias pseudoaleatorias de aplicación criptográfica [PDF]
, 1998 Sin ...
Caballero Gil, P., Fúster, SABATER A.
core +2 more sources