• DocumentCode
    1519558
  • Title

    On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$

  • Author

    Liao, Xiaofeng ; Chen, Fei ; Wong, Kwok-Wo

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Chongqing Univ., Chongqing, China
  • Volume
    59
  • Issue
    10
  • fYear
    2010
  • Firstpage
    1392
  • Lastpage
    1401
  • Abstract
    In this paper, the period distribution of sequences generated by Chebyshev polynomials over the finite field ZN is analyzed. It is found that the distribution is unsatisfactory if N (the modulus) is not chosen properly. Based on this finding, we present an attack on the public-key algorithm based on Chebyshev polynomials over ZN. Then, we modify the original algorithm to make it suitable for practical purpose. Its security under some existing models is also discussed in detail.
  • Keywords
    Chebyshev approximation; chaos; polynomials; public key cryptography; statistical distributions; Chebyshev polynomials; finite field ZN; public-key algorithms; Chebyshev approximation; Galois fields; Polynomials; Public key; Zinc; Chaos; Chebyshev polynomials; period distribution; public-key cryptography; security analysis.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2010.148
  • Filename
    5487511
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1519558