Abstract
T-functions have been introduced by Shamir and Klimov in [1]. Those functions can be used in order to design a new class of stream ciphers. We present in this paper an algorithm which can retrieve the internal state of a particular class of pseudo-random generators based on T-functions. This algorithm has time complexity of \(O(2^{\frac{n}{4}})\) and has memory complexity of O(n log2 n ) for pseudo random generators which put out the n/2 most significants bits of their internal state at each time clock, n being the length of the internal state of the pseudo-random generator.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Klimov, A., Shamir, A.: A new class of invertible mappings. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 470–483. Springer, Heidelberg (2003)
Klimov, A., Shamir, A.: Cryptographic applications of T-functions. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bénony, V., Recher, F., Wegrzynowski, É., Fontaine, C. (2005). Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_23
Download citation
DOI: https://doi.org/10.1007/11423461_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26084-4
Online ISBN: 978-3-540-32048-7
eBook Packages: Computer ScienceComputer Science (R0)