✦ LIBER ✦

Public-key encryption based on Chebyshev polynomials over

✍ Scribed by J.B. Lima; D. Panario; R.M. Campello de Souza

Book ID: 108154728
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 158 KB
Volume: 111
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Public-Key Encryption Based on Chebyshev

Public-Key Encryption Based on Chebyshev Polynomials

✍ L. Kocarev; J. Makraduli; P. Amato 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 123 KB

Security analysis of the public key algo

Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring ZN

✍ Fei Chen; Xiaofeng Liao; Tao Xiang; Hongying Zheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Revocation-free public-key encryption ba

Revocation-free public-key encryption based on security-mediated public-key infrastructure

✍ Lo, C.-M.; Hwang, T.; Li, C.-M. 📂 Article 📅 2007 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 161 KB

Fast public-key encryption scheme based

Fast public-key encryption scheme based on Chinese remainder theorem

✍ Baocang Wang; Yongzhuang Wei; Yupu Hu 📂 Article 📅 2009 🏛 SP Higher Education Press 🌐 English ⚖ 124 KB

A new public-key encryption scheme based

A new public-key encryption scheme based on LUCas sequence

✍ Zhengtao Jiang; Yanhua Hao; Yumin Wang 📂 Article 📅 2005 🏛 SP Science Press 🌐 English ⚖ 395 KB

On using primes for public key encryptio

On using primes for public key encryption systems

✍ E.Dennis Huthnance; Joe Warndof 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 221 KB

It is shown that the popular RSA public key encryption scheme does not require two primes but that probable primes may be used instead. A method for finding probable primes is given and the security of systems based on probable primes is discussed.