Abstract
At CRYPTO 2017, Liu presented a general framework of iterative estimation of algebraic degree for NFSR-based cryptosystems, by exploiting a technique, called numeric mapping, and gave distinguishing attacks on Trivium-like ciphers, including Trivium, Kreyvium and TriviA-SC. This paper aims at further investigating algebraic degree estimation of NFSR-based cryptosystems from a new perspective. A new general framework for algebraic degree estimation of NFSR-based cryptosystems is formalized to exploit a new way of constructing distinguishing attacks. This illustrates that our new framework is more accurate than Liu’s when estimating the upper bound on algebraic degree of NFSR-based cryptosystems. As result, the best known attack on the full simplified variant of TriviA-SC v2 is presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cannière, C.: Trivium: a stream cipher construction inspired by block cipher design principles. In: Katsikas, S.K., López, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 171–186. Springer, Heidelberg (2006). https://doi.org/10.1007/11836810_13
Hell, M., Johansson, T., Maximov, A., Meier, W.: The grain family of stream ciphers. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 179–190. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68351-3_14
Babbage, S., Dodd, M.: The MICKEY stream ciphers. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 191–209. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68351-3_15
ECRYPT. The eSTREAM project. http://www.ecrypt.eu.org/stream/
Wu, H.: ACORN: a lightweight authenticated cipher (v3). CAESAR Submission (2016). http://competitions.cr.yp.to/round3/acornv3.pdf
De Cannière, C., Dunkelman, O., Knežević, M.: KATAN and KTANTAN — a family of small and efficient hardware-oriented block ciphers. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 272–288. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04138-9_20
Aumasson, J.-P., Henzen, L., Meier, W., Naya-Plasencia, M.: Quark: a lightweight hash. J. Cryptology 26(2), 313–339 (2012). https://doi.org/10.1007/s00145-012-9125-6
Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptology 31(3), 885–916 (2018). https://doi.org/10.1007/s00145-017-9273-9
Chakraborti, A., Chattopadhyay, A., Hassan, M., Nandi, M.: TriviA: a fast and secure authenticated encryption scheme. In: Güneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 330–353. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48324-4_17
Chakraborti, A., Nandi, M.: TriviA-ck-v2. CAESAR Submission (2015). http://competitions.cr.yp.to/round2/triviackv2.pdf
Liu, M.: Degree evaluation of NFSR-based cryptosystems. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 227–249. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63697-9_8
Ding, L., Wang, L., Gu, D., Jin, C., Guan, J.: Algebraic degree estimation of ACORN v3 using numeric mapping. Secur. Commun. Netw. 2019, 1–5, Article ID 7429320 (2019). https://doi.org/10.1155/2019/7429320
Yang, J., Liu, M., Lin, D.: Cube cryptanalysis of round-reduced ACORN. In: Lin, Z., Papamanthou, C., Polychronakis, M. (eds.) ISC 2019. LNCS, vol. 11723, pp. 44–64. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30215-3_3
Ding, L., Wang, L., Gu, D., Jin, C., Guan, J.: A new general method of searching for cubes in cube attacks. In: Meng, W., Gollmann, D., Jensen, C.D., Zhou, J. (eds.) ICICS 2020. LNCS, vol. 12282, pp. 369–385. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61078-4_21
Kesarwani, A., Roy, D., Sarkar, S., Meier, W.: New cube distinguishers on NFSR-based stream ciphers. Des. Codes Crypt. 88(1), 173–199 (2019). https://doi.org/10.1007/s10623-019-00674-1
Xu, C., Zhang, B., Feng, D.: Linear cryptanalysis of FASER128/256 and TriviA-ck. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 237–254. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13039-2_14
Acknowledgements
The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China under Grant 61602514, 61802437, 61272488, 61202491, 61572516, 61272041, 61772547, National Cryptography Development Fund under Grant MMJJ20170125 and National Postdoctoral Program for Innovative Talents under Grant BX201700153.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix
A The Procedure \({\textbf {CDE}}{{\textbf {G}}_{Tri}}\) for \(\delta = B\) and \(\delta = C\)
The procedure \({\textbf {CDE}}{{\textbf {G}}_{Tri}}\) in the two cases, \(\delta = B\) and \(\delta = C\), are described in Algorithms 4 and 5, respectively.
B The Cubes Used in Our Attacks
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ding, L., Wu, Z. (2022). New General Framework for Algebraic Degree Evaluation of NFSR-Based Cryptosystems. In: Park, J.H., Seo, SH. (eds) Information Security and Cryptology – ICISC 2021. ICISC 2021. Lecture Notes in Computer Science, vol 13218. Springer, Cham. https://doi.org/10.1007/978-3-031-08896-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-031-08896-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08895-7
Online ISBN: 978-3-031-08896-4
eBook Packages: Computer ScienceComputer Science (R0)