Public-key encryption based on Chebyshev polynomials

DOI10.1007/S00034-005-2403-XMaRDI QIDQ2508451zbMATH OpenOpenAlexWikidataFDO

Authors Ljupco Kocarev, J. Makraduli, Paolo Amato

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) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Cryptography (94A60)

Recommendations

• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• Chaos-Based Public-Key Cryptography
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• CRYPTANALYSIS OF CHAOS-BASED ELGAMAL PUBLIC-KEY ENCRYPTION

Cited in

(16)

• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• Applying semigroup property of enhanced Chebyshev polynomials to anonymous authentication protocol
• Lessons learnt from the cryptanalysis of chaos-based ciphers
• Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
• CRYPTANALYSIS OF CHAOS-BASED ELGAMAL PUBLIC-KEY ENCRYPTION
• A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields Z_p
• scientific article; zbMATH DE number 1263592 (Why is no real title available?)
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• scientific article; zbMATH DE number 1461535 (Why is no real title available?)
• A type of public cryptosystem using polynomials and pell sequences
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• Secure communication systems based on the synchronization of chaotic systems
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field Z_N
• Theory and practice of chaotic cryptography
• Design of an alternative to polynomial modified RSA algorithm
• A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508451)