On the Linearity of Cryptographic Sequence Generators

Author(s)
Fuster-Sabater, Amparo
Delgado-Mohatar, Oscar
Brankovic, Ljiljana
Publication Date
2010
Abstract
<p>In this paper we show that the output sequences of the generalized self-shrinking generator are particular solutions of a binary homogeneous linear difference equation. In fact, all these sequences are just linear combinations of primary sequences weighted by binary coefficients. We show that in addition to the output sequences of the generalized selfshrinking generator, the complete class of solutions of the corresponding binary homogeneous linear difference equation also includes other balanced sequences that are very suitable for cryptographic applications, as they have the same period and even greater linear complexity than the generalized self-shrinking sequences. Cryptographic parameters of all the above mentioned sequences can be analyzed in terms of linear equation solutions.</p>
Citation
p. 586-596
ISBN
9783642121654
9783642121647
Link
Publisher
Springer-Verlag Berlin Heidelberg
Series
Lecture Notes in Computer Science
Title
On the Linearity of Cryptographic Sequence Generators
Type of document
Conference Publication
Entity Type
Publication

Files:

NameSizeformatDescriptionLink