Introduction to finite fields and their applications
Introduction to finite fields and their applications
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
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
Generalized self-shrinking generator
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In the present work, it is shown that the binary sequences obtained from a cryptographic generator, the so-called generalized self-shrinking generator, are just particular solutions of a type of linear difference equations. Cryptographic parameters e.g. period, linear complexity or balancedness of the previous sequences can be analyzed in terms of linear equation solutions. In brief, computing the solutions of linear difference equations is an easy method of generating new sequences with guaranteed cryptographic parameters.