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
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
BDD-Based Cryptanalysis of Keystream Generators
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
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
The linear complexity of the self-shrinking generator
IEEE Transactions on Information Theory
Generalized self-shrinking generator
IEEE Transactions on Information Theory
Two New Attacks on the Self-Shrinking Generator
IEEE Transactions on Information Theory
Generalization of the self-shrinking generator in the galois field GF(pn)
Advances in Artificial Intelligence
Performance evaluation of highly efficient techniques for software implementation of LFSR
Computers and Electrical Engineering
Some cryptanalysis of a p-ary generalized self-shrinking generator
Proceedings of the 13th International Conference on Computer Systems and Technologies
About balance property of the p-ary generalized self-shrinking generator sequence
Proceedings of the 14th International Conference on Computer Systems and Technologies
| Hi-index | 0.00 |
The self-shrinking generator SSG, an elegant keystream generator proposed by Meier and Staffelbach, is built up from a single n-stage primitive linear feedback shift register (LFSR) to produce a keystream of period P=2^n^2, and linear complexity greater than half its period. In this article, we propose a new variant of the self-shrinking generator called the modified self-shrinking generator MSSG. This new generator is based on a primitive n-stage LFSR and uses an extended selection rule based on the XORed value of a pair of bits. We prove that the keystreams of the MSSG are balanced, and have period greater than or equal to 2^n^3, linear complexity greater than half the period, and possess good statistical properties. We investigate the security of the generator against various powerful cryptanalytic attacks. We show that the MSSG is more secure than the SSG against most of these attacks. Moreover, experiments show that for odd values of n, 3