✦ LIBER ✦

Public-Key Encryption Based on Chebyshev Polynomials

✍ Scribed by L. Kocarev; J. Makraduli; P. Amato

Publisher: Springer
Year: 2005
Tongue: English
Weight: 123 KB
Volume: 24
Category: Article
ISSN: 0278-081X
DOI: 10.1007/s00034-005-2403-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Representation Attacks on the Braid Diff

Representation Attacks on the Braid Diffie-Hellman Public Key Encryption

✍ Arkadius G. Kalka 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 131 KB

A Fourier series kernel based on Chebysh

A Fourier series kernel based on Chebyshev polynomials

✍ E. Rietsch 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 668 KB

Second order Chebyshev methods based on

Second order Chebyshev methods based on orthogonal polynomials

✍ Assyr Abdulle; Alexei A. Medovikov 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 335 KB

On the concealability of messages by the

On the concealability of messages by the williams public-key encryption scheme

✍ S. Kothari; S. Lakshmivarahan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 665 KB

A (plaintext) message is said to be unconcealable if the encrypted message is the same as the original plaintext message. An analysis of the Williams public-key encryption scheme from the point of view of (un) concealability of messages is presented.