skip to main content
10.1145/2383276.2383296acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

Some cryptanalysis of a p-ary generalized self-shrinking generator

Published: 22 June 2012 Publication History

Abstract

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.

References

[1]
Coppersmith D., H. Krawczyk, Y. Mansour, The shrinking generator, Advances in Cryptology -- EUROCRYPT'93, vol.773 of LNCS, Berlin, Springer-Verlag, 1993, pp. 22--39.
[2]
Dudewicz E. J. and Ralley T. G., The Handbook of Random Number Generation and Testing with TESTRAND Computer Code, American Sciences Press, Columbus, Ohio, 1981, ps. 634.
[3]
Hell M., Johansson T., Two new attacks on the self-shrinking generator, IEEE Transactions on Information Theory, Vol. 52, No. 8, 2006, pp. 3837--3843.
[4]
Kanso Ali, Modified self-shrinking generator, Computer and Electrical Engineering 36, 2010, Elsivier Ltd., pp. 993--1001.
[5]
Krause M., BDD-Based Cryptanalysis of Keystream Generators, Advances in Cryptology --- EUROCRYPT 2002, Lecture Notes in Computer Science, 2002, Volume 2332/2002, Berlin, Germany: Springer-Verlag, pp. 222--237.
[6]
Meier W., O. Staffelbach, The self-shrinking generator. In A. De Santis, editor, Advances in Cryptology -- EUROCRYPT '94, vol.950 of LNCS, Berlin, Springer-Verlag, 1995, pp. 205--214.
[7]
Mihaljevic M. J., A faster cryptanalysis of self-shrinking generator, In J. Pieprzyk and J. Seberry, editors, Advances in Cryptology -- ACISP '96, vol.1172 of LNCS, Berlin,1996, Springer-Verlag, pp.182--189.
[8]
Schneier B., Applied Cryptography, Jhon Wiley & Sous Inc., 1998, ps. 758.
[9]
Zhang B., Feng D., New Guess-and-Determine Attack on the Self-Shrinking Generator, Advances in Cryptology -- ASIACRYPT 2006, Lecture Notes in Computer Science, 2006, Volume 4284/2006, Berlin, Germany: Springer-Verlag, pp. 54--68.
[10]
Zenner E., M. Krause, and S. Lucks, "Improved cryptanalysis of self-shrinking generator," in Proc. ACIPS'2001 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2001, vol. 2119, pp. 21--35.
[11]
Tasheva A. T., Zh. N. Tasheva, A. M. Petrov, Generalization of the Self-Shrinking Generator in the Galois Field GF(pn), Advances in Artificial Intelligence, vol. 2011, Article ID 464971, 10 pages, 2011.
[12]
Tasheva A., Zh. Tasheva, Period of the Sequences Produced by the p-ary Generalized Self-Shrinking Generator, Proceedings of the Sixth International Scientific Workshop "Computer Science'11" Supercomputer Architectures and Applications, Ohrid, Macedonia, 01--03 September 2011, pp. 70--75.

Cited By

View all
  • (2013)About balance property of the p-ary generalized self-shrinking generator sequenceProceedings of the 14th International Conference on Computer Systems and Technologies10.1145/2516775.2516786(299-306)Online publication date: 28-Jun-2013

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '12: Proceedings of the 13th International Conference on Computer Systems and Technologies
June 2012
440 pages
ISBN:9781450311939
DOI:10.1145/2383276
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. LFSR
  2. PRNG
  3. SSG
  4. cryptography
  5. stream cipher

Qualifiers

  • Research-article

Conference

CompSysTech'12

Acceptance Rates

Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2013)About balance property of the p-ary generalized self-shrinking generator sequenceProceedings of the 14th International Conference on Computer Systems and Technologies10.1145/2516775.2516786(299-306)Online publication date: 28-Jun-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media