Skip to main content
Top
Published in: Designs, Codes and Cryptography 1/2019

21-05-2018

New results on the state cycles of Trivium

Authors: Shiyong Zhang, Gongliang Chen

Published in: Designs, Codes and Cryptography | Issue 1/2019

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Trivium is a well-known lightweight synchronous stream cipher that was submitted to the European eSTREAM project in April 2005. Thus far, it has been difficult to determine cycles of the internal state values of Trivium, remaining an open problem to date. In this paper, the internal structure of Trivium is exploited to generate an algorithm called Trivium-model. Based on Trivium-model, some new results are obtained through the state cycles of Trivium. It is noted that there exists one cycle of size 10, one cycle of size 11, two cycles of size 12, one cycle of size 15 and at least 16 cycles of size \(3(2^{93}-1)\). Therefore, the distribution of cycle lengths is not equiprobable, and small cycles exist. These cycles may cause the weak initial states and be the vulnerability of Trivium.
Literature
1.
go back to reference Biham E., Dunkelman O.: Cryptanalysis of the A5/1 GSM Stream Cipher. Cryptology, Proceedings of Indocrypt 00, Computer Science 1977, Springer, New York, pp. 43–51 (2000). Biham E., Dunkelman O.: Cryptanalysis of the A5/1 GSM Stream Cipher. Cryptology, Proceedings of Indocrypt 00, Computer Science 1977, Springer, New York, pp. 43–51 (2000).
2.
go back to reference Borghoff J., Knudsen L.R., Stolpe M.: Bivium as a mixed-integer linear programming problem. In: Parker M.G. (ed.) LNCS, vol. 5921, pp. 133–152. Springer, Heidelberg (2009). Borghoff J., Knudsen L.R., Stolpe M.: Bivium as a mixed-integer linear programming problem. In: Parker M.G. (ed.) LNCS, vol. 5921, pp. 133–152. Springer, Heidelberg (2009).
5.
go back to reference Dinur I., Shamir A.: Cube attacks on weakable black box polynomials. In: Joux A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 278–299. Springer, Heidelberg (2009).CrossRef Dinur I., Shamir A.: Cube attacks on weakable black box polynomials. In: Joux A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 278–299. Springer, Heidelberg (2009).CrossRef
6.
go back to reference Fouque P.A., Vannet T.: Improving key recovery to 784 and 799 rounds of trivium using optimized cube attacks. In: Moriai S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 502–517. Springer, Heidelberg (2014). Fouque P.A., Vannet T.: Improving key recovery to 784 and 799 rounds of trivium using optimized cube attacks. In: Moriai S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 502–517. Springer, Heidelberg (2014).
8.
go back to reference Hu H., Gong G.: Periods on two kinds of nonlinear feedback shift registers with time varying feedback functions. Int. J. Found. Comput. 22(6), 1317–1329 (2011).MathSciNetCrossRefMATH Hu H., Gong G.: Periods on two kinds of nonlinear feedback shift registers with time varying feedback functions. Int. J. Found. Comput. 22(6), 1317–1329 (2011).MathSciNetCrossRefMATH
9.
go back to reference Lechtaler A.C., Cipriano M., García E., César J., Liporace A.M., Malvacio E.: Trivium vs. trivium toy. In: Argentinean Congress on Computer Science—III Workshop Computer Security. ISBN 978-987-3806-05-6. pp. 161–172 (2014). Lechtaler A.C., Cipriano M., García E., César J., Liporace A.M., Malvacio E.: Trivium vs. trivium toy. In: Argentinean Congress on Computer Science—III Workshop Computer Security. ISBN 978-987-3806-05-6. pp. 161–172 (2014).
10.
go back to reference Maximov A., Biryukov A.: Two trivial attacks on TRIVIUM. In: SASC2007: The State of the Art of Stream Ciphers, pp. 1–16 (2007). Maximov A., Biryukov A.: Two trivial attacks on TRIVIUM. In: SASC2007: The State of the Art of Stream Ciphers, pp. 1–16 (2007).
13.
14.
go back to reference Smart N.: Cryptography: An Introduction. McGraw-Hill Education, New York. ISBN 0-077-09987-7 (2003). Smart N.: Cryptography: An Introduction. McGraw-Hill Education, New York. ISBN 0-077-09987-7 (2003).
15.
go back to reference Wang Z., Qi W., Tian T.: A note on determine the greatest common subfamily of two NFSRs by Gröbner basis. J. Syst. Sci. Complex. 28, 1231–1242 (2015).MathSciNetCrossRefMATH Wang Z., Qi W., Tian T.: A note on determine the greatest common subfamily of two NFSRs by Gröbner basis. J. Syst. Sci. Complex. 28, 1231–1242 (2015).MathSciNetCrossRefMATH
Metadata
Title
New results on the state cycles of Trivium
Authors
Shiyong Zhang
Gongliang Chen
Publication date
21-05-2018
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1/2019
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-018-0493-2

Other articles of this Issue 1/2019

Designs, Codes and Cryptography 1/2019 Go to the issue

Premium Partner