CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On Some Properties of the Shrinking Generator
Designs, Codes and Cryptography
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
The Shrinking Generator: Some Practical Considerations
Fast Software Encryption, Cambridge Security Workshop
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Modified self-shrinking generator
Computers and Electrical Engineering
Analysis of the generalized self-shrinking generator
Computers & Mathematics with Applications
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
Two New Attacks on the Self-Shrinking Generator
IEEE Transactions on Information Theory
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 proposed by Meier and Staffelbach Self-Shrinking Generator (SSG) which has efficient hardware implementation only with a single Linear Feedback Shift Register is suitable for low-cost and fast stream cipher applications. In this paper we generalize the idea of the SSG for arbitrary Galois Field GF(pn). The proposed variant of the SSG is called the p-ary Generalized Self-Shrinking Generator (pGSSG). We suggest a method for transformation of a non-binary self-shrunken pGSSG sequence into balanced binary sequence. We prove that the keystreams of the pGSSG have large period and good statistical properties. The analysis of the experimental results shows that the pGSSG sequences have good randomness properties. We examine the complexity of exhaustive search and entropy attacks of the pGSSG. We show that the pGSSG is more secure than SSG and Modified SSG against these attacks. We prove that the complexity of the used pGSSG attacks increases with increasing the prime p. Previously mentioned properties give the reason to say that the pGSSG satisfy the basic security requirements for a stream chipper and can be useful as a part of modern stream ciphers.