Journal of the Chungcheong Mathematical Society (충청수학회지)

The Chungcheong Mathematical Society (충청수학회)
권호 표지
DOI QR코드

DOI QR Code

ON A CHARACTERIZATION OF SECURE TRINOMIALS ON ℤ2n

  • Received : 2016.07.11
  • Accepted : 2016.10.13
  • Published : 2016.11.15
Download PDF
⟨ Previous Next ⟩

Abstract

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. Such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them T-functions are probably invertible transformations and are very useful in stream ciphers. In this paper we will characterize a secure trinomial on ${\mathbb{Z}}_{2^n}$ which generates an n-bit word sequence without consecutive elements of period $2^n$.

Keywords

References

  1. A. Kilmov, Applications of T-functions in cryptography, Ph.D. Thesis, Weizmann Institute Science, 2005.
  2. A. Kilmov and A. Shamir, A new class of invertible mappings, CHES 2002, LNCS 2523 (2003), 470-483.
  3. A. Kilmov and A. Shamir, Cryptographic applications of T-functions, SAC 2003, LNCS 3006 (2004), 248-261.
  4. A. Kilmov and A. Shamir, New cryptographic primitives based on multiword T-functions, FSE 2004, LNCS 3017 (2004), 1-15.
  5. M. S. Rhee, On a characterization of T-function with one cycle property, J. of the Chungcheong Math. Soc. 21 (2008), no. 2, 259-268.
  6. M. S. Rhee, On a secure binary sequences generated by a quadratic polynomial on ${\mathbb{Z}}_{2^n}$, J. of the Applied Math. and Informatics 29 (2011), no. 1-2, 247-255. https://doi.org/10.14317/JAMI.2011.29.1_2.247
  7. R. L. Rivest, Permutation polynomials modulo $2^w$, Finite fields and their applications 7 (2001), 287-292. https://doi.org/10.1006/ffta.2000.0282