Skip to main content
SpringerLink
Log in

The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function

  • Conference paper
Sequences and Their Applications – SETA 2006 (SETA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4086))

Included in the following conference series:

Abstract

In this paper, we study single-cycle T-functions which have important applications in new cryptographic algorithms. We present the algebraic normal form (ANF) of all single-cycle T-functions and the enumeration of single-cycle functions, which reveal many mysterious aspects of such functions. We also investigate the linear complexity and the k-error complexity of single-cycle T-functions when n=2t, the results also reflect the good stability of single-cycle T-functions.

This work was supported by National Natural Science Foundation of China (90304007) and China Postdoctoral Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benony, V., Recher, F., Wegrzynowski, E., Fontaine, C.: An Improved Method to Retrieve Internal State of Klimov-Shamir Pseudo-Random Sequence Generators. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 138–142. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  3. Games, R.A., Chan, A.H.: A Fast Algorithm for Determining the Complexity of a Binary Sequence with Period 2n. IEEE Transactions on Information Theory 29(1), 144–146 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hong, J., Lee, D.H., Yeom, Y., Han, D.: A New Class of Single Cycle T-functions. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 68–82. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Klimov, A., Shamir, A.: Cryptographic Applications of T-Functions. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 248–261. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Klimov, A.B., Shamir, A.: New Cryptographic Primitives Based on Multiword T-Functions. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 1–15. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Kurosawa, K., Sato, F., Sakata, T., Kishmoto, W.: A Relationship Between Linear Complexity and k-error Linear Complexity. IEEE Transactions on Information Theory 46(2), 694–698 (2000)

    Article  MATH  Google Scholar 

  9. Massey, J.L.: Shift-register syuthesis and BCH decoding. IEEE Transactions on Information Theory 15, 122–127 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  10. Meidl, W.: On the Stability of 2n Periodic Binary Sequences. IEEE Transactions on Information Theory 51(3), 1151–1155 (2005)

    Article  MathSciNet  Google Scholar 

  11. Molland, H., Helleseth, T.: A linear weakness in the Klimov-Shamir T-function. In: Proceedings of the 2005 IEEE Int. Symposium on Information Theory, pp. 1106–1110 (2005)

    Google Scholar 

  12. Stamp, M., Martin, C.F.: An Algorithm for the k-error Linear Complexity of Binary Sequences with Period 2n. IEEE Transactions on Information Theory 39(4), 1398–1401 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China

    Wenying Zhang & Chuan-Kun Wu

Authors
  1. Wenying Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chuan-Kun Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Guang Gong

  2. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, W., Wu, CK. (2006). The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_34

Download citation

  • DOI: https://doi.org/10.1007/11863854_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44523-4

  • Online ISBN: 978-3-540-44524-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation