A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial

DOI10.1007/S10623-025-01574-3MaRDI QIDQ6956598zbMATH OpenFDO

Authors Rudong Min, Jiale Han, Shouliang Li, Zhen Yang, Yi Yang

Publication date 18 July 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-025-01574-3

zbMATH Keywords

chaotic systemFermat's little theoremgeneral Chebyshev polynomialpublic key encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A new digital signature scheme based on chaotic maps
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Almost periodic solutions for second order dynamic equations on time scales
• An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps
• An efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map
• An efficient entire chaos-based scheme for deniable authentication
• Cryptanalysis of the public key encryption based on multiple chaotic systems
• Elliptic Curve Cryptosystems
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field Z_N
• Provably secure three-party key agreement protocol using Chebyshev chaotic maps in the standard model
• Public-key encryption based on Chebyshev polynomials
• Security of a key agreement protocol based on chaotic maps
• Security of public-key cryptosystems based on Chebyshev polynomials

This page was built for publication: A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial

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