A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials

DOI10.1142/S0218127422500444MaRDI QIDQ5064646zbMATH OpenOpenAlexFDO

Authors Zhengjun Cao, Li Hua Liu

Publication date 16 March 2022

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218127422500444

zbMATH Keywords

complexityChebyshev polynomialhalve-and- square evaluationmatrix-multiplication-based evaluationroot-extraction-based evaluation

Mathematics Subject Classification ID

Cryptography (94A60) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Recommendations

• Security of public-key cryptosystems based on Chebyshev polynomials
• Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• Public-key encryption based on Chebyshev polynomials
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• scientific article; zbMATH DE number 3859027
• On Cryptosystems Based on Polynomials and Finite Fields
• Cryptanalysis and improvement of a three-party key agreement protocol using enhanced Chebyshev polynomials
• A note on complete polynomials over finite fields and their applications in cryptography

Cites work

• scientific article; zbMATH DE number 177620 (Why is no real title available?)
• A Secret Key Cryptosystem by Iterating a Chaotic Map
• APPLICATION OF DISCRETE CHAOTIC DYNAMICAL SYSTEMS IN CRYPTOGRAPHY — DCC METHOD
• Adleman-Manders-Miller root extraction method revisited
• Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
• Hopping from Chebyshev polynomials to permutation statistics
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• Security of public-key cryptosystems based on Chebyshev polynomials
• The Graph Structure of the Generalized Discrete Arnold's Cat Map
• The graph structure of Chebyshev polynomials over finite fields and applications

Cited in

(7)

• On computing the degree of a Chebyshev polynomial from its value
• Three theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module \(2^w\)
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
• Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
• Public-key encryption based on Chebyshev polynomials
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)

This page was built for publication: A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials

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