On Public-Key Encryption Scheme Based on Chebyshev Maps
2011 ◽
Vol 268-270
◽
pp. 1110-1114
Keyword(s):
Due to the exceptionally desirable properties, Chebyshev polynomials have been recently proposed for designing public key cryptosystems. However, some proposed schemes were pointed out to be insecure and unpractical. In this paper, we analyze their defects, discretize the Chebyshev maps, generalize properties of Chebyshev polynomials and design an improved scheme. Theoretical analysis shows that it possesses higher security than RSA and experimental results shows it can be implemented easily.
2019 ◽
Vol 508
◽
pp. 012131
2009 ◽
Vol 20
(10)
◽
pp. 2907-2914
◽
2018 ◽
Vol 19
(4)
◽
pp. 481-493
◽
2019 ◽
Vol 10
(11)
◽
Keyword(s):