Provably secure public key cryptosystem based on chebyshev polynomials

被引：5

作者：

Yan, Shijie ^{[1
]}

Zhen, Ping ^{[1
]}

Min, Lequan ^{[1
,2
]}

机构：

[1] School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing

[2] School of Mathematics and Physics, University of Science and Technology Beijing, Beijing

来源：

Journal of Communications | 2015年 / 10卷 / 06期

关键词：

Chebyshev polynomials; Chosen ciphertext attack; Provable security; Public key crypto-system;

D O I：

10.12720/jcm.10.6.380-384

中图分类号：

学科分类号：

摘要：

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. © 2015 Journal of Communications.

引用

页码：380 / 384

页数：4

共 22 条

[1]

Diffie W.F., Hellman M.E., New directions in cryptography, IEEE Transactions on Information Theory, 22, 10, pp. 644-655, (1976)

[2]

Lee M.S., Improved cryptanalysis of a knapsack-based probabilistic encryption scheme, Inf. Sci, 222, pp. 779-783, (2013)

[3]

Lyubashevsky V., Lattice Signatures without Trapdoors, Advances in Cryptology-Eurocrypt, 7237, pp. 738-755, (2012)

[4]

Fujita H., Quantum McEliece public-key cryptosystem, Quantum Information &Amp

[5]

Computation, 12, 3-4, pp. 181-202, (2012)

[6]

Kocarev L., Tasev Z., Public-key encryption based on Chebyshev maps, Proc. IEEE International Symposium on Circuits System, 3, pp. 28-31, (2003)

[7]

Kocarev L., Makraduli J., Amato P., Public-key encryption based on Chebyshev polynomials, Circuits, Systems and Signal Processing, 24, 5, pp. 497-517, (2005)

[8]

Cramer R., Shoup V., A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, Advances in Cryptology-Crypto '99, 1462, pp. 13-25, (1998)

[9]

Bellare M., Rogaway P., Optimal asymmetric encryption - How to encrypt with RSA, Advances in Cryptology - Eurocrypt, 950, pp. 92-111, (1994)

[10]

Rackoff C., Simon D., “Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack, Advances in Cryptology-Crypto '91, pp. 433-444, (1991)

← 1 2 3 →