Public-key encryption based on Chebyshev polynomials

DOI10.1007/S00034-005-2403-XzbMath1103.94018OpenAlexW2090396608WikidataQ56866133 ScholiaQ56866133MaRDI QIDQ2508451

Paolo Amato, Ljupčo Kocarev, J. Makraduli

Publication date: 12 October 2006

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-005-2403-x

zbMATH Keywords

ElGamal and RSA algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Related Items (5)

Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials ⋮ Theory and practice of chaotic cryptography ⋮ Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) ⋮ Secure Communication Systems Based on the Synchronization of Chaotic Systems ⋮ Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

This page was built for publication: Public-key encryption based on Chebyshev polynomials