Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / one-way functions

Date: received 9 May 2012, last revised 20 Aug 2012

Contact author: kaiyuen at jaist ac jp

Available format(s): PDF | BibTeX Citation

Note: PDF version uploaded due to editor's suggestion

Version: 20120821:040917 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]