Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring Z_N

DOI10.1016/J.INS.2011.07.008MaRDI QIDQ429602zbMATH OpenOpenAlexWikidataFDO

Authors Fei Chen, Xiaofeng Liao, Tao Xiang, Hongying Zheng

Publication date 20 June 2012

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2011.07.008

zbMATH Keywords

chaosdynamical systemperiodic orbitsecurity analysisperiod distributionpublic key algorithm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• Public-key encryption based on Chebyshev polynomials
• Three theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module \(2^w\)
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• Chaos-Based Public-Key Cryptography

Cites work

• scientific article; zbMATH DE number 3141365 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 3458752 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• scientific article; zbMATH DE number 2002850 (Why is no real title available?)
• A criterion for primitiveness of polynomials over \(\mathbb{Z}{}/(2^ d)\)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A symmetric image encryption scheme based on 3D chaotic cat maps
• An anonymous key agreement protocol based on chaotic maps
• An improved key agreement protocol based on chaos
• Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
• Chaos and cryptography: block encryption ciphers based on chaotic maps
• Chaotic block ciphers: from theory to practical algorithms
• Color image encryption based on one-time keys and robust chaotic maps
• Elliptic Curve Cryptosystems
• Finding the differential characteristics of block ciphers with neural networks
• Linear Complexity and Random Sequences
• Maximal period polynomials over \(\mathbb{Z}/(p^ d)\)
• New directions in cryptography
• New stream cipher designs. The eSTREAM finalists
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
• Public-key encryption based on Chebyshev polynomials
• Secure group key agreement protocol based on chaotic hash
• Security of public-key cryptosystems based on Chebyshev polynomials
• Selective image encryption using a spatiotemporal chaotic system
• The stability theory of stream ciphers
• Theory and practice of chaotic cryptography
• Use of chaotic dynamical systems in cryptography
• Using time-stamp to improve the security of a chaotic maps-based key agreement protocol

Cited in

(7)

• Three theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module \(2^w\)
• On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
• CRYPTANALYSIS OF CHAOS-BASED ELGAMAL PUBLIC-KEY ENCRYPTION
• Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
• Public-key encryption based on Chebyshev polynomials
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)

This page was built for publication: Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)

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