An improved attack on clock-controlled shift registers based on hardware implementation
- 78 Downloads
Abstract
We cryptanalyze a type of stream generator with three linear-feedback shift registers that are mutually clocked in a stop/go manner and have the property of sequences of state space convergence. By guessing the clock-controlled sequence and employing a backtracking search, we propose an algorithm attack on the type of stream generator based on hardware implementation. In particular, the time complexity of the algorithm attacking the encryption algorithm A5/1 is 243.869 clock periods. With our hardware architecture, we investigate the implementation of the algorithm on field programmable gate array and application-specific integrated circuit for an attack on A5/1. As a result, we can retrieve the initial states of A5/1’s registers in 2 s on average without pre-computation if we have 64 known key-stream bits.
Keywords
stop/go clocking A5/1 state space convergence SMITH special-purpose hardwarePreview
Unable to display preview. Download preview PDF.
References
- 1.Zeng G, He K C, Han W B. A trinomial type of σ-LFSR oriented toward software implementation. Sci China Ser F-Inf Sci, 2007, 50: 359–372MathSciNetMATHGoogle Scholar
- 2.GSM Association. GSM World-Home of the GSM Association. http://www.gsmworld.com/
- 3.Anderson R. A5 (was: Hacking digital phones). http://yarchive.net/phone/gsmcipher.html, Newsgroup Communication, 1994Google Scholar
- 4.Golic J. Cryptanalysis of alleged A5 stream cipher. In: Proceedings of Eurocrypt’97. Berlin: Springer-Verlag, 1997. 239–255Google Scholar
- 5.Golic J. Cryptanalysis of three mutually clock-controlled stop/go shift registers. IEEE Trans Inf Theory, 2000, 46: 1081–1090MathSciNetCrossRefMATHGoogle Scholar
- 6.Biryukov A, Shamir A, Wagner D. Real time cryptanalysis of A5/1 on a PC. In: Proceedings of the 8th International Workshop on Fast Software Encryption, Yokohama, 2001. 1–18CrossRefGoogle Scholar
- 7.Kumar S, Paar C, Pelzl J, et al. Breaking ciphers with COPACOBANA-a cost-optimized parallel code breaker. In: Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems 2006, Yokohama, 2006, 101–118CrossRefGoogle Scholar
- 8.Nohl K, Paget C. GSM: SRSLY? In: 26th Chaos Communication Congress, Berlin, 2009Google Scholar
- 9.Krause M. BDD-based cryptanalysis of keystream generators. In: Proceedings of EUROCRYPT 2002, Amsterdam, 2002. 222–237CrossRefGoogle Scholar
- 10.Stegemann D. Fbdd-basierte kryptanalyse des A5/1 schlussel strom generators (in German). Thesis for the Master’s Degree. Mannheim: University of Mannheim, 2004Google Scholar
- 11.Hu Z Y, Sun F C. Ciphertext verification security of symmetric encryption schemes. Sci China Ser F-Inf Sci, 2009, 52: 1617–1631MathSciNetCrossRefMATHGoogle Scholar
- 12.Hamdan A, Bartlett H. State space convergence in the A5/1 keystream generator. http://www.spms.ntu.edu.sg/Asiacrypt2010/Rump, 2010Google Scholar
- 13.Glendrange M, Hove K, Hvideberg E. Decoding GSM. Thesis for the Master’s Degree. Trondheim: Norwegian University of Science and Techonology, 2010Google Scholar
- 14.Keller J. Efficient sampling of the structure of crypto generators’ state transition graphs. In: Proceedings of the Second European Conference on Computer Network Defence, Wales, 2007. 3–12Google Scholar
- 15.Bogdanov A, Mertens M, Paar C, et al. A parallel hardware architecture for fast Gaussian elimination over GF(2). In: Proceedings of the 14th IEEE Symposium on Field-Programmable Custom Computing Machines, Napa, 2006. 237–248Google Scholar