A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials

DOI10.1142/S0218127422500444zbMath1485.94067OpenAlexW4220769631MaRDI QIDQ5064646

Lihua Liu, Zhengjun Cao

Publication date: 16 March 2022

Published in: International Journal of Bifurcation and Chaos (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)

Cites Work

• Unnamed Item
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms
• The graph structure of Chebyshev polynomials over finite fields and applications
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• Hopping from Chebyshev polynomials to permutation statistics
• Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials
• The Graph Structure of the Generalized Discrete Arnold's Cat Map
• A Secret Key Cryptosystem by Iterating a Chaotic Map
• Security of public-key cryptosystems based on Chebyshev polynomials
• Adleman-Manders-Miller Root Extraction Method Revisited
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
• APPLICATION OF DISCRETE CHAOTIC DYNAMICAL SYSTEMS IN CRYPTOGRAPHY — DCC METHOD

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