Paper 2012/263

One-way Functions from Chebyshev Polynomials

Kai-Yuen Cheong

Abstract

In the past twenty years, the study of the conjunction of chaos and cryptography has attracted much interest but also met with many problems. Today the security of chaos-based encryptions is usually not considered comparable to those based on number theoretic functions. In this paper, instead of making an encryption system, we focus on the more fundamental notion of one-way function, which is a well-defined function that is easy to evaluate but hard to invert. We see that it is more natural to compare chaotic systems with one-way functions, and such a study could possibly give new insights for chaos-based cryptosystems. We propose a function based on Chebyshev polynomials, and we argue it is likely a one-way function.

Note: PDF version uploaded due to editor's suggestion

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
one-way functions
Contact author(s)
kaiyuen @ jaist ac jp
History
2012-08-21: revised
2012-05-14: received
See all versions
Short URL
https://ia.cr/2012/263
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/263,
      author = {Kai-Yuen Cheong},
      title = {One-way Functions from Chebyshev Polynomials},
      howpublished = {Cryptology ePrint Archive, Paper 2012/263},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/263}},
      url = {https://eprint.iacr.org/2012/263}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.