A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
DOI10.1142/S0218127422500444zbMATH Open1485.94067OpenAlexW4220769631MaRDI QIDQ5064646FDOQ5064646
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
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
complexityChebyshev polynomialhalve-and- square evaluationmatrix-multiplication-based evaluationroot-extraction-based evaluation
Cryptography (94A60) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)
Cites Work
- Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms
- Security of public-key cryptosystems based on Chebyshev polynomials
- The Graph Structure of the Generalized Discrete Arnold's Cat Map
- 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$
- A Secret Key Cryptosystem by Iterating a Chaotic Map
- Title not available (Why is that?)
- Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
- The graph structure of Chebyshev polynomials over finite fields and applications
- APPLICATION OF DISCRETE CHAOTIC DYNAMICAL SYSTEMS IN CRYPTOGRAPHY — DCC METHOD
- Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
- Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
- Adleman-Manders-Miller root extraction method revisited
- Hopping from Chebyshev polynomials to permutation statistics
Cited In (7)
- On computing the degree of a Chebyshev polynomial from its value
- On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
- 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}\)
- 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)
