Three ways to mount distinguishing attacks on irregularly clocked stream ciphers

International Journal of Security and Networks

Volumn 1, Issue 1-2, 2006, Pages 95-102

  Englund, Hakan ^a   Johansson, Thomas ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

cryptanalysis; distinguishing attacks; irregularly clocked LFSRs; keystream generators; low weight linear relations; pseudo random number generator; step one step two generator; stream ciphers; vector based attacks

Indexed keywords

EID: 72449209394     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/ijsn.2006.010826     Document Type: Article

References (22)

1. Canteaut, A. and Trabbia, M. (2000) ‘Improved fast correlation attacks using parity-check equations of weight 4 and 5’, in B. Preneel (Ed). Advances in Cryptology – EUROCRYPT 2000, Vol. 1807, Lecture Notes in Computer Science, Springer-Verlag, pp.573–588.
2. Chepyzhov, V., Johansson, T. and Smeets, B. (2000) ‘A simple algorithm for fast correlation attacks on stream ciphers’, in B. Schneier (Ed). Fast Software Encryption 2000, Vol. 1978, Lecture Notes in Computer Science, Springer-Verlag, pp.181–195.
3. Coppersmith, D., Halevi, S. and Jutla, C. (2002) ‘Cryptanalysis of stream ciphers with linear masking’, in M. Yung (Ed). Advances in Cryptology – CRYPTO 2002, Vol. 2442, Lecture Notes in Computer Science, Springer-Verlag, pp.515–532.
4. Courtois, N. (2003) ‘Fast algebraic attacks on stream ciphers with linear feedback’, in D. Boneh (Ed). Advances in Cryptology – CRYPTO 2003, Vol. 2729, Lecture Notes in Computer Science, Springer-Verlag, pp.176–194.
5. Courtois, N. and Meier, W. (2003) ‘Algebraic attacks on stream ciphers with linear feedback’, in E. Biham (Ed). Advances in Cryptology – EUROCRYPT 2003, Vol. 2656, Lecture Notes in Computer Science, Springer-Verlag, pp.345–359.
6. Cover, T. and Thomas, J. (1991) ‘Elements of information theory’, Wiley Series in Telecommunication, Wiley.
7. Daemen, J. and Rijmen, V. (2002) The Design of Rijndael, Springer-Verlag.
8. Ekdahl, P. and Johansson, T. (2002) ‘Distinguishing attacks on SOBER-t16 and SOBER-t32’, in J. Daemen and V. Rijmen (Eds). Fast Software Encryption 2002, Vol. 2365, Lecture Notes in Computer Science, Springer-Verlag, pp.210–224.
9. Englund, H. and Johansson, T. (2005a) ‘A new distinguisher for clock controlled stream ciphers’, Fast Software Encryption 2005, Lecture Notes in Computer Science, Springer-Verlag.
10. Englund, H. and Johansson, T. (2005b) ‘A new simple technique to attack filter generators and related ciphers’, in H. Handschuh and A. Hasan (Eds). Selected Areas in Cryptography – SAC 2004, Vol. 3357, Lecture Notes in Computer Science, Springer-Verlag, pp.39–53.
11. Golić, J. (1996) ‘Computation of low-weight parity-check polynomials’, Electronic Letters, Vol. 32, No. 21, pp.1981–1982.
12. Golić, J. and Menicocci, R. (2003) ‘A new statistical distinguisher for the shrinking generator’, Available at: http://eprint.iacr.org/2003/041. Accessed on 29 September.
13. Johansson, T. and Jönsson, F. (1999a) ‘Fast correlation attacks based on turbo code techniques’, in M.Wiener (Ed). Advances in Cryptology – CRYPTO’99, Vol. 1666, Lecture Notes in Computer Science, Springer-Verlag, pp.181–197.
14. Johansson, T. and Jönsson, F. (1999b) ‘Improved fast correlation attacks on stream ciphers via convolutional codes’, in J. Stern (Ed). Advances in Cryptology – EUROCRYPT’99, Vol. 1592, Lecture Notes in Computer Science, Springer-Verlag, pp.347–362.
15. Johansson, T. and Jönsson, F. (2000) ‘Fast correlation attacks through reconstruction of linear polynomials’, in M. Bellare (Ed). Advances in Cryptology – CRYPTO 2000, Vol. 1880, Lecture Notes in Computer Science, Springer-Verlag, pp.300–315.
16. Johansson, T. and Jönsson, F. (2002) ‘A fast correlation attack on LILI-128’, Information Processing Letters, Vol. 81, pp.127–132.
17. Junod, P. (2003) ‘On the optimality of linear, differential and sequential distinguishers’, Advances in Cryptology – EUROCRYPT 2003, Vol. 2656, Lecture Notes in Computer Science, Springer-Verlag, pp.17–32.
18. Maximov, A. and Johansson, T. (2005) ‘Fast computation of large distributions and its cryptographic applications’, Advances in Cryptology – ASIACRYPT 2005, Vol. 3788, Lecture Notes in Computer Science, Springer-Verlag, pp.313–332.
19. Meier, W. and Staffelbach, O. (1988) ‘Fast correlation attacks on stream ciphers’, in C. Günter (Ed). Advances in Cryptology – EUROCRYPT’88, Vol. 330, Lecture Notes in Computer Science, Springer-Verlag, pp.301–316.
20. Siegenthaler, T. (1984) ‘Correlation-immunity of non-linear combining functions for cryptographic applications’, IEEE Transactions on Information Theory, Vol. 30, pp.776–780.
21. Wagner, D. (2002) ‘A generalized birthday problem’, in M. Yung (Ed). Advances in Cryptology – CRYPTO 2002, Vol. 2442, Lecture Notes in Computer Science, Springer-Verlag, pp.288–303.
22. Watanabe, D., Biryukov, A. and Canniere, C.D. (2003) ‘A distinguishing attack of SNOW 2.0 with linear masking method’, in Selected Areas in Cryptography—SAC 2003, Vol. 3006 of Lecture Notes in Computer Science, Springer-Verlag, pp.222–233.