Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)

DOI10.1016/j.ipl.2010.10.011zbMath1260.94068OpenAlexW1999421523WikidataQ123014163 ScholiaQ123014163MaRDI QIDQ1944037

R. M. Campello de Souza, Daniel Panario, Juliano B. Lima

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.011

zbMATH Keywords

Chebyshev polynomialsfinite fieldscryptographypublic-key encryption

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) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials ⋮ Tangent-Chebyshev maps over finite fields: new properties and functional graphs ⋮ A trigonometric approach for Dickson polynomials over fields of characteristic two

Cites Work

• Unnamed Item
• Unnamed Item
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Security of public-key cryptosystems based on Chebyshev polynomials

This page was built for publication: Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)