CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Strategic attack on the shrinking generator
Theoretical Computer Science
Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
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
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
An analysis of the structure and complexity of nonlinear binary sequence generators
IEEE Transactions on Information Theory
Generalized self-shrinking generator
IEEE Transactions on Information Theory
Generalization of the self-shrinking generator in the galois field GF(pn)
Advances in Artificial Intelligence
Hi-index | 0.09 |
This work shows that the output sequences of a well-known cryptographic generator, the so-called generalized self-shrinking generator, are particular solutions of homogeneous linear difference equations with binary coefficients. In particular, all those generated sequences are just linear combinations of primary sequences weighted by binary values. Furthermore, the complete class of solutions of these difference equations includes other balanced sequences with the same period and even greater linear complexity than that of the generalized self-shrinking sequences. Cryptographic parameters of all above mentioned sequences are here analyzed in terms of linear equation solutions. In addition, this work describes an efficient algorithm to synthesize the component primary sequences as well as to compute the linear complexity and period of any generalized self-shrinking sequence.