New attack strategy for the shrinking generator

Journal of Research and Practice in Information Technology

Volumn 41, Issue 2, 2009, Pages 181-190

  Caballero Gil, Pino ^a   Fúster Sabater, Amparo ^b   Pazo Robles, M Eugenia ^c  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

^b Consejo Superior de Investigaciones Científicas   (Spain)

^c INSTITUTO TECNOLÓGICO DE BUENOS AIRES   (Argentina)

Author keywords

Cryptanalysis; Stream cipher

Indexed keywords

ATTACK STRATEGIES; CRYPTANALYSIS; INITIAL STATE; INTERLEAVED SEQUENCE; LINEAR COMPLEXITY; STREAM CIPHER;

SHRINKAGE;

CRYPTOGRAPHY;

EID: 68049117087     PISSN: 1443458X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. ASSIS, F. and PEDREIRA, C. (2000): An architecture for computing Zech's logarithms in GF(2m), IEEE Transactions on Computers 49 (5): 519-524.
2. BETH, T. and PIPER, F. (1985): The stop-and-go generator. Lecture Notes in Computer Science 209 Springer Verlag: 88-92.
3. BLUETOOTH (2001): Specifications of the Bluetooth system, www.bluetooth.com
4. CABALLERO-GIL, P. and FÚSTER-SABATER, A. (2004): A wide family of nonlinear filter functions with a large linear span, Information Sciences, 164: 197-207.
5. CABALLERO-GIL, P. and FÚSTER-SABATER, A. (2006): Using linear hybrid cellular automata to attack the shrinking generator, IEICE Transactions on Fundamentals of Electronics Communications and Computer, E89-A: 1166-1172.
6. COPPERSMITH, D., KRAWCZYK, H. and MANSOUR, H. (1994): The shrinking generator. Lecture Notes in Computer Science 773 Springer-Verlag: 22-39.
7. FÚSTER-SABATER, A. (2004): Run distribution in nonlinear binary generators. Applied Mathematics Letters 17: 1427-1432.
8. GOLIC, J. and O'CONNORS, L. A (1995): Cryptanalysis of clock-controlled shift registers with multiple steps, Cryptography: Policy and Algorithms 41: 174-185.
9. GOLLMANN, D. and CHAMBERS, W.C. (1989): Clock-controlled shift registers: A review. IEEE Transactions on Selected Areas in Communications SAC-7 May: 525-533.
10. GONG, G. (1995): Theory and applications of q-ary interleaved sequences. IEEE Transactions on Information Theory, 41(2): 400-411.
11. GSM (1999): Global systems for mobile communications, cryptome.org/gsm-a512.htm
12. JENNINGS, S.M. (1983): Multiplexed sequences: Some properties of the minimum polynomial. Lecture Notes in Computer Science 149 Springer Verlag: 189-206.
13. JIANG, S., DAI, Z. and GONG, G. (2002): On interleaved sequences over finite fields. Discrete Mathematics, 252: 161-178.
14. JOHANSSON, T. (1998): Complexity correlation attacks on two clock-controlled generators, Lecture Notes in Computer Science 1426, Springer-Verlag: 342-356.
15. KANSO, A. (2003): Clock-controlled shrinking generator of feedback shift registers, Lecture Notes in Computer Science, vol. 2727, Springer Verlag: 443-451.
16. LIDL, R. and NIEDERREITER, H. (1986): Introduction to finite fields and their applications. Cambridge University Press.
17. RIVEST.R.L. (1998): RSA data security, Inc.
18. SHPARLINSKI, I. (2001): On some properties of the shrinking generator. Designs, Codes and Cryptography 23: 147-156.
19. SIMPSON, L., GOLIC J. and DAWSON, E. (1998): A probabilistic correlation attack on the shrinking generator, Lecture Notes in Computer Science, vol. 1438, Springer Verlag: 147-158.