Public-Key Encryption Based on Chebyshev Polynomials

被引：0

作者：

L. Kocarev

J. Makraduli

P. Amato

机构：

[1] Institute for Nonlinear Science,

[2] University of California,undefined

[3] San Diego,undefined

[4] 9500 Gilman Drive,undefined

[5] La Jolla,undefined

[6] CA 92093-0402,undefined

[7] Faculty of Electrical Engineering,undefined

[8] Karpos II,undefined

[9] Skopje,undefined

[10] STMicroelectronics,undefined

[11] Soft Computing,undefined

[12] Si-Optics and Post Silicon Technology,undefined

[13] Corporate RandD Via Remo De Feo 1,undefined

[14] 80022 Arzano (Napoli),undefined

来源：

Circuits, Systems and Signal Processing | 2005年 / 24卷

关键词：

Digital Signature; Chebyshev Polynomial; Encryption Algorithm; Software Implementation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We propose public-key encryption algorithms based on Chebyshev polynomials, which are secure, practical, and can be used for both encryption and digital signature. Software implementation and properties of the algorithms are discussed in detail. We show that our ElGamal-like and RSA-like algorithms (when Chebyshev polynomials are employed) are as secure as the original ElGamal and RSA algorithms.

引用

页码：497 / 517

页数：20