Abstract
T-functions have been widely used in the design of symmetric ciphers, hash functions, and fast cryptographic primitives. Single cycle polynomial T-functions are a special category. If they are used as state transition functions of stream ciphers, the security of the generated sequences is crucial. In 2008, Kolokotronis proposed a conjecture regarding the autocorrelation function’s values of coordinate sequences generated by single cycle polynomial T-functions. In this paper, we show that the conjecture does not hold in general and prove the conditions under which it holds.
Similar content being viewed by others
References
Anashin V., Bogdanov A., Kizhvatov I., Kumar S.: ABC: A new fast flexible stream cipher. ECRYPT Stream Cipher Project Report. https://www.cosic.esat.kuleuven.be/ecrypt/stream/ciphers/abc/abc.pdf. Accessed 30 Aug 2015.
Anashin V., Khrennikov A.: Applied Algebraic Dynamics. Walter de Gruyter, Berlin (2009).
Anashin V., Khrennikov A., Yurova E.: T-functions revisited: new criteria for bijectivity/transitivity. Des. Codes Cryptogr. 71, 383–407 (2014).
Anashin V.: Non-archimedean ergodic theory and pseudorandom generators. Comput. J. 53, 370–392 (2010).
Anashin V.: The non-archimedean theory of discrete systems. Math. Comput. Sci. 6, 375–393 (2012).
Anashin V.: Uniformly distributed sequences of p-adic integers. Math. Notes 55, 109–133 (1994).
Anashin V.: Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers. J. Math. Sci. 89, 1355–1390 (1998).
Anashin V.: Uniformly distributed sequences of p-adic integers II. Discret. Math. Appl. 12, 527–590 (2002).
Klimov A.: Applications of T-functions in cryptography. Ph.D. Thesis, Department of Applied Mathe-matics and Computer Science, Weizmann Institute of Science (2005).
Klimov A., Shamir A.: A new class of invertible mappings. In: Kaliski Jr. B.S., (ed.) Proceedings of Workshop on Cryptographic Hardware and Embedded Systems 2002. Lecture Notes in Computer Science, vol. 2523, pp. 470–483. Springer, Berlin (2003).
Klimov A., Shamir A.: Cryptographic applications of T-functions. In: Matsui M., Zuccherato R. (eds.) Proceedings of Workshop on Selected Areas in Cryptography 2003. Lecture Notes in Computer Science, vol. 3006, pp. 248–261. Springer, Berlin (2004).
Klimov A., Shamir A.: New applications of T-functions in block ciphers and hash functions. In: Gilbert H., Handschuh H. (eds.) Proceedings of Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 18–31. Springer, Berlin (2005).
Kolokotronis N.: Cryptographic properties of nonlinear pseudorandom number generators. Des. Codes Cryptogr. 46, 353–363 (2008).
Larin M.V.: Transitive polynomial transformations of residue class rings. Discret. Math. Appl. 12, 127–140 (2002).
Lausch H., Nöbauer W.: Algebra of Polynomials. North-Holland, Amsterdam (1973).
Lerner E.E.: Uniform distribution of sequences generated by iterated polynomials. Doklady Math. 3, 704–706 (2015).
Mayhew G.L.: Auto-correlation properties of modified de Bruijn sequences. In: Proceedings of 2000 IEEE Position Location and Navigation Symposium, pp. 349–354. IEEE Press (2000).
Molland H., Helleseth T.: A linear weakness in the Klimov-Shamir T-function. In: Proceedings of 2005 IEEE International Symposium on Information Theory, pp. 1106–1110 (2005).
Roy D., Chaturvedi A., Mukhopadhyay S.: New Constructions of T-function. Information Security Practice and Experience, pp. 395–405. Springer, Heidelberg (2015).
Shi T., Anashin V., Lin D.D.: Linear Weaknesses in T-functions. In: Helleseth T., Jedwab J. (eds.) Proceedings of Sequences and Their Applications 2012. Lecture Notes in Computer Science, vol. 7280, pp. 279–290. Springer, Berlin (2012).
Wang J.S., Qi W.F.: Linear equation on polynomial single cycle T-functions. In: Pei D.Y., et al. (eds.) Proceedings of Information Security and Cryptology 2007. Lecture Notes in Computer Science, vol. 4990, pp. 256–270. Springer, Berlin (2008).
Zhang, H.N., Wang, X.Y.: Differential cryptanalysis of T-function based stream cipher TSC-4. In: Nam K.H., Rhee G. (eds.), Proceedings of Information Security and Cryptology 2007. Lecture Notes in Computer Science, vol. 4817, pp. 227–238. Springer, Berlin (2007).
Zhang W., Wu C.K.: The algebraic normal form, linear complexity and k-error linear complexity of single-cycle T-function. In: Gong G. et al. (eds.) SETA 2006. Lecture Notes on Computer Science, vol. 4086, pp. 391–401. Springer, Berlin (2006).
Acknowledgements
The authors would like to thank the anonymous reviewers for their detailed comments and suggestions. This work was supported by the National Natural Science Foundation of China [Grant Nos. 61272041, 61502532].
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. Carlet.
Rights and permissions
About this article
Cite this article
Wang, S., Hu, B. & Liu, Y. The autocorrelation properties of single cycle polynomial T-functions. Des. Codes Cryptogr. 86, 1527–1540 (2018). https://doi.org/10.1007/s10623-017-0410-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-017-0410-0