• Please send your full manuscript to: jcm@etpub.com

Provably Secure Public Key Cryptosystem Based on Chebyshev Polynomials

Shijie Yan1, Ping Zhen1, and Lequan Min1,2
1.School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China
2.School of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083, China
Abstract—Chebyshev polynomials based public key cryptosystem (CPPKC), proposed by L. Kocarev in 2003, has emerged as a new research field in cryptography and attracted a lot of attentions in recent years. Although provable security in traditional public key cryptosystem has already been developed about twenty years, no relevant security proof research has been found about CPPKC. Aiming at the disability of CPPKC to resist against the adaptive chosen ciphertext attack, we construct a provably secure CPPKC, namely PS-CPPKC, which is designed utilizing the benefits of hash function and its security proof is completed under the Cheybshev Diffie-Hellman problem (CDHP) assumption by probabilistic analyses and computation in random oracle model. This is our primary exploration and it shows that provable security theory can combine well with CPPKC.

Index Terms—Chebyshev polynomials, public key crypto-system, chosen ciphertext attack, provable security

Cite: Shijie Yan, Ping Zhen, and Lequan Min, "Provably Secure Public Key Cryptosystem Based on Chebyshev Polynomials," Journal of Communications, vol. 10, no. 6, pp. 380-384, 2015. Doi: 10.12720/jcm.10.6.380-384
Copyright © 2013-2017 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com