Correlation Analysis of Output Streams Jump Generators in Stream Ciphers

Document Type : Original Article

Authors

Sadr Researcher Center, Tehran, Iran

Abstract

One method of design the LFSR-based stream ciphers is using irregular clock that it is most famous structures. In recent years became a springboard technique called clock control that improves efficiency compared to generators has become tighter. In this way, instead of several clock has been changed and values, in the state through the middle. Per basic polynomials, a jump in the index jump is still there. It is clear that for the length of each LFSR, there are several initial polynomials that same period, but the size of the jump index is different. In this paper, by analyzing the correlation attack on generators springboard, it was concluded that the selection of index jump polynomials with maximum results in minimum correlation between output and input sequence is productive. So in the design of stream ciphers with a springboard generation structure, in terms of correlation attacks, the polynomial with most rate of jump up the index is priority.

Keywords

References

[1] A. A. Alhamdan, Secure Stream Cipher Initialization Processes, Ph.D. Thesis, University of Queensland, 2014.
[2] T. Beth and F. Piper, “The stop-and-go generator,” Advances in Cryptology, Eurocrypt, vol. 84, pp. 88–92, 1985.
[3] C.G. Günther, “Alternating step generators controlled by De Bruijn sequences,” Advances in Cryptography, Eurocrypt ’87, vol. 304, pp. 5–14, 1988.
[4] D. Coppersmith, H. Krawczyk and Y. Mansour, “The shrinking generator,” Advances in Cryptology, CRYPTO ’93, Santa Barbara, vol. 773, pp. 22–39, 1994.
[5] حامد مؤمنی و محمدعلی طاهری، «حمله تحلیل زمان روی یک الگوریتم رمز جریانی»، مجله علمی-پژوهشی پدافند الکترونیکی و سایبری، سال چهارم، شماره 1، صفحات 57-51، 1395.
[6] C. J. Jansen, “Modern stream cipher design: A new view on multiple clocking and irreducible polynomials,” Acts de la VII Reunion Espanola sobre Criptologia y Seguridad de la Information, vol. 1, pp.11-29, 2002.
[7] C. J. A. Jansen, T. Helleseth and A. Kholosha, “Cascade jump controlled sequence generator and Pomaranch stream cipher,” Lecture Notes in Computer Science 4986,  pp. 224-243, 2008.
[8] S. H. Babbage and M.W. Dodd, “The stream cipher MICKEY 2.0,” ECRYPT stream cipher project, 2006. http://www.ecrypt.eu.org/stream/.
[9] F. Masoodi, S. Alam and M. U. Bokhari, “An analysis of linear feedback shift register in stream ciphers,” International journal of Computer Applications, Vol. 46, No. 17, pp.46-49, 2012.
[10] A. C. Lechtaler, M. Cipriano, E. Garcia, J. Liporace. A. Maoirano and E. Malvacio, “Model design for a reduced variant of a Trivium type stream cipher,” JCS&T. Vol. 14, No. 1, 2014
[11] A. Klein, Stream Cipher. Dept. of Pure Mathem. & Computer Algebra, State University of Ghent, Belgium. London Heidelberg New York Dordrecht. Springer 2013
[12] J. D. Golic, “Correlation analysis of the shrinking generator,” CRYPTO 2001, vol. 2139, pp. 440-457, 2001.
[13] محمدعلی طاهری و حامد مؤمنی، «ارائه روش طراحی رمزهای قالبی مبتنی بر کلید وابسته به داده برای مقاومت در برابر حملات خطی و تفاضلی»، مجله علمی-پژوهشی پدافند الکترونیکی و سایبری، سال پنجم، شماره 1، صفحات 45-37، 1396.
[14] H. Momeni, M. Masoumi, and A. Dehghan, “A practical fault induction attack against an FPGA implementation of AES cryptosystem,” World Congress on Internet Security (World CIS2013), pp. 134-138, 2013.
[15] شهرام جمالی و عرفان آقایی کیاسری، «بهبود حمله مکعبی کانال جانبی بر روی الگوریتم‌های بلوکی»، مجله مهندسی برق دانشگاه تبریز، جلد 45، شماره 4، زمستان 1394.
[16] S. Babbage and M. Dodd, “Finding characteristic polynomials with jump indices,” IACR Cryptology ePrint Archive, p. 10, 2006.
[17] C. J. A. Jansen, “Stream cipher design based on jumping finite state machines,” IACR Cryptology ePrint Archive, p. 267, 2005.
[18] G. Zeng, Y. Yang, W. Han and S. Fan, “Word oriented cascade jump σ−LFSR,” M. Bras Amor´os and T. Høholdt (Eds.), AAECC vol. 9, pp. 127–136, 2009.
[19] T. Siegenthaler, “Decrypting a class of stream ciphers using cipher text only”. IEEE Trans. Computers, no. 34(1), pp.81–85, 1985.

Files

Share

How to cite

Statistics