The Research Of Identity Authentication Based On Public Key Cryptosystems Of Chaos

Chaotic system has great application value in cryptography because of its sensitive dependence on initial conditions and pseudo-randomness. In recent years, a lot of chaotic cryptosystems have been proposed; however, most of them focus on encryption algorithm of secret key cryptography. Compared with chaotic secret key cryptography, there is much less research on public-key cryptography based on chaos. The most representative public-key cryptography based on chaos is public-key cryptography algorithms based on Chebyshev polynomials, which is proposed by L.Kocarev. The idea lead to the development of public-key cryptosystems based on chaos, which includes encryption algorithms, digital signatures, key agreement, identity authentication and other aspects. But the research is still elementary, many problems still exist. So, research of public-key cryptosystem based on Chebyshev polynomials is meaningful.With the development of communication technology and the widely use of ecommerce, identity authentication has become the most important line of defense in information security of network. Chebyshev polynomials based on finite fields can be used in public-key encryption algorithms, key agreement and identity authentication for its good semi-group property and one-way trapped characteristic. In this paper, an ElGamal-like algorithm using Chebyshev polynomials based on finite fields is deeply researched and the security of the proposed identity authentication scheme based on chebyshev polynomials is also analyzed. According to the above research, the new identity authentication schemes based on chebyshev polynomials are proposed. The program results of the new identity authentication schemes analysis prove the schemes are secure and practical.