CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
Modified self-shrinking generator
Computers and Electrical Engineering
Generalization of the self-shrinking generator in the galois field GF(pn)
Advances in Artificial Intelligence
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
Two New Attacks on the Self-Shrinking Generator
IEEE Transactions on Information Theory
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 binary Pseudo Random Sequences (PRSs) with maximum period and good statistical and correlation properties have been widely used in cryptography and modern communication and information systems. To achieve unconditional security of the PRSs applications they must have long period, balance property, run property, n-tuple distribution, two-level auto correlation, low-level cross correlation and large linear span. Because of that the architecture of a p-ary Generalized Self-Shrinking Generator (pGSSG) which produces non binary nonlinear PRSs is proposed in this paper. The security of the pGSSG against the exhaustive search and entropy attacks are investigated. It is shown that the pGSSG is more secure than Self-Shrinking Generator and Modified SSG (MSSG) against these attacks. It is proven that the complexity of the used pGSSG attack increases with increasing the prime p.