[LIVRE][B] Stream ciphers and number theory
TW Cusick, C Ding, AR Renvall - 2004 - books.google.com
This is the unique book on cross-fertilisations between stream ciphers and number theory. It
systematically and comprehensively covers known connections between the two areas that …
systematically and comprehensively covers known connections between the two areas that …
Linear complexity and related complexity measures for sequences
H Niederreiter - International Conference on Cryptology in India, 2003 - Springer
We present a survey of recent work on the linear complexity, the linear complexity profile,
and the k-error linear complexity of sequences and on the joint linear complexity of …
and the k-error linear complexity of sequences and on the joint linear complexity of …
Computing the error linear complexity spectrum of a binary sequence of period 2/sup n
AGB Lauder, KG Paterson - IEEE Transactions on Information …, 2003 - ieeexplore.ieee.org
Binary sequences with high linear complexity are of interest in cryptography. The linear
complexity should remain high even when a small number of changes are made to the …
complexity should remain high even when a small number of changes are made to the …
On the stability of 2/sup n/-periodic binary sequences
W Meidl - IEEE Transactions on Information Theory, 2005 - ieeexplore.ieee.org
The k-error linear complexity of a periodic binary sequence is defined to be the smallest
linear complexity that can be obtained by changing k or fewer bits per period. This …
linear complexity that can be obtained by changing k or fewer bits per period. This …
How many bits have to be changed to decrease the linear complexity?
W Meidl - Designs, Codes and Cryptography, 2004 - Springer
The k-error linear complexity of periodic binary sequences is defined to be the smallest
linear complexity that can be obtained by changing k or fewer bits of the sequence per …
linear complexity that can be obtained by changing k or fewer bits of the sequence per …
On the -Adic Complexity and the -Error -Adic Complexity of Periodic Binary Sequences
H Hu, D Feng - IEEE transactions on information theory, 2008 - ieeexplore.ieee.org
A significant difference between the linear complexity and the 2-adic complexity of periodic
binary sequences is pointed out in this correspondence. Based on this observation, we …
binary sequences is pointed out in this correspondence. Based on this observation, we …
Properties of the error linear complexity spectrum
This paper studies the error linear complexity spectrum of binary sequences with period 2n.
A precise categorization of those sequences having two distinct critical points in their …
A precise categorization of those sequences having two distinct critical points in their …
The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
FW Fu, H Niederreiter, M Su - … and Their Applications–SETA 2006: 4th …, 2006 - Springer
The linear complexity of sequences is one of the important security measures for stream
cipher systems. Recently, using fast algorithms for computing the linear complexity and the k …
cipher systems. Recently, using fast algorithms for computing the linear complexity and the k …
On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
We propose a construction of de Bruijn sequences by the cycle joining method from linear
feedback shift registers (LFSRs) with arbitrary characteristic polynomial f (x). We study in …
feedback shift registers (LFSRs) with arbitrary characteristic polynomial f (x). We study in …
Periodic sequences with large k-error linear complexity
H Niederreiter - IEEE Transactions on Information Theory, 2003 - ieeexplore.ieee.org
We establish the existence of periodic sequences over a finite field which simultaneously
achieve the maximum value (for the given period length) of the linear complexity and of the k …
achieve the maximum value (for the given period length) of the linear complexity and of the k …