Generalization of one method of a filter generator key recovery
-
Evgeniy K. Alekseev
and
Lyudmila A. Kuschinskaya
Abstract
We describe an algorithm extending the previously proposed method of key recovery of a filter generator. The algorithm is based on an approximation of the combining function by algebraically degenerate functions. We give estimates of the computational complexity, reliability, and the amount of memory used by the method. Examples of application of the method are considered, in particular, for the analysis of the LILI-128 cipher.
Note: Originally published in Diskretnaya Matematika (2017) 29, №4, 3–27 (in Russian).
Funding
This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 16-01-00470 A).
Acknowledgement
The authors are deeply grateful to O. A. Logachev, A. A. Chilikov, S. V. Smyshlyaev, and G. A. Karpunin for their valuable comments, constructive criticism, and help in the preparation of the manuscript. The authors would like to express special thanks to the referees F. M. Malyshev and A. V. Tarasov for a thorough and thoughtful reading of this paper and for several helpful suggestions that allowed us to rectify some errors and inaccuracies and make the presentation more accessible.
References
[1] Alekseev E.K., Kushchinskaya L.A., “On the construction of generalized approximations for one filter generator key recovery method”, 6rd Workshop on Current Trends in Cryptology (CTCrypt 2017), Pre-proceedings, 2017, 247-259.Search in Google Scholar
[2] Ashur T., Beyne T., Rijmen V., “Revisiting the wrong-key-randomization hypothesis”, Report 2016/990, IACR Cryptology ePrintArchive, 2016.Search in Google Scholar
[3] Biham E., Shamir A., “Differential cryptanalysis of DES-like cryptosystems”, J. Cryptology, 4:1 (1991), 3–72.10.1007/BF00630563Search in Google Scholar
[4] Bogdanov A., Tischhauser E., “On the wrong key randomisation and key equivalence hypotheses in Matsui’s algorithm 2”, FSE 2013, Lect. Notes Comput. Sci., 8424 (2013), 19–38.10.1007/978-3-662-43933-3_2Search in Google Scholar
[5] Collard B., Standaert F.-X., “Experimenting linear cryptanalysis”, Advanced Linear Cryptanalysis of Block and Stream Ciphers, Cryptology and Information Security Series, 7, IOS Press, 2011.Search in Google Scholar
[6] Dawson E., Clark A., Golic J., Millan W., Penna L., Simpson L., “The LILI-128 keystream generator”, Proc. of First NESSIE Workshop, 2000, http://www.cryponessie.org.Search in Google Scholar
[7] Junod P., “On the complexity of Matsui’s attack”, Lect. Notes Comput. Sci., 2259, 2001, 199–211.10.1007/3-540-45537-X_16Search in Google Scholar
[8] Matsui M., “Linear cryptanalysis method for DES cipher”, EUROCRYPT ’93, Lect. Notes Comput. Sci., 765, 1994, 386-397.10.1007/3-540-48285-7_33Search in Google Scholar
[9] Meier W., Staffelbach O., “Fast correlation attacks on certain stream cipher”, J. Cryptology, 1:3 (1989), 159-176.10.1007/BF02252874Search in Google Scholar
[10] Siegenthaler T., “Decrypting a class of stream cipher using ciphertext only”, IEEE Trans. Computers, C-34(1) (1985), 81-85.10.1109/TC.1985.1676518Search in Google Scholar
[11] Alekseev E.K., “About an attack on the filter generator with a complication function close to an algebraically singular”, Sb. statey molodykh uchenykh fakul’teta VMK MGU, 2011, № 8, 114-123 (in Russian).Search in Google Scholar
[12] Alekseev E.K., “On some measures of nonlinearity of Boolean functions”, Prikladnaya diskretnaya matematika, 2 (2011), 5-16 (in Russian).10.17223/20710410/12/1Search in Google Scholar
[13] Glukhov M.M., Elizarov V.P., Nechaev A.A., Algebra: Textbook. In 2 volumes, M.: Gelios ARV, 2003 (in Russian), 416 pp.Search in Google Scholar
[14] Logachev O.A., Sal’nikov A.A., Smyshlyaev S.V., Yashchenko V.V., Boolean functions in coding theory and cryptography, LENAND, Moscow, 2015 (in Russian), 584 pp.Search in Google Scholar
[15] Sevast’yanov B.A., Course of probability theory and mathematical statistics, M.: Nauka, 1982 (in Russian), 256 pp.Search in Google Scholar
© 2019 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Generalization of one method of a filter generator key recovery
- Boolean functions as points on the hypersphere in the Euclidean space
- Artinian bimodule with quasi-Frobenius bimodule of translations
- Asymptotic behavior of functions Ω(k; n) and ω(k; n) related to the number of prime divisors
- On some properties of vector functions of Boolean algebra
- Modules over strongly semiprime rings
Articles in the same Issue
- Frontmatter
- Generalization of one method of a filter generator key recovery
- Boolean functions as points on the hypersphere in the Euclidean space
- Artinian bimodule with quasi-Frobenius bimodule of translations
- Asymptotic behavior of functions Ω(k; n) and ω(k; n) related to the number of prime divisors
- On some properties of vector functions of Boolean algebra
- Modules over strongly semiprime rings
