On the linearity of cryptographic sequence generators

Authors:
Amparo Fuster-Sabater;Oscar Delgado-Mohatar;Ljiljana Brankovic
Affiliations:
Institute of Applied Physics, C.S.I.C., Madrid, Spain;Institute of Applied Physics, C.S.I.C., Madrid, Spain;School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, Australia
Venue:
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Year:
2010

Citing 12
Cited 1

Introduction to finite fields and their applications

Introduction to finite fields and their applications
The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Shift Register Sequences

Shift Register Sequences
A faster cryptanalysis of the self-shrinking generator

ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
Improved Cryptanalysis of the Self-Shrinking Generator

ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Cryptanalytic Attack on Cryptographic Sequence Generators: The Class of Clock-Controlled Shrinking Generators

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Strategic attack on the shrinking generator

Theoretical Computer Science
Multiplexed sequences: some properties of the minimum polynomial

Proceedings of the 1982 conference on Cryptography
New guess-and-determine attack on the self-shrinking generator

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Generalized self-shrinking generator

IEEE Transactions on Information Theory
Theory and applications of q-ary interleaved sequences

IEEE Transactions on Information Theory

Generation of pseudorandom binary sequences with controllable cryptographic parameters

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 self-shrinking 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.