Font Size: a A A

The Study Of Polymorphic Authentication Key Agreement Protocol Based On Chebyshev Chaotic Maps

Posted on:2017-01-19Degree:MasterType:Thesis
Country:ChinaCandidate:X HaoFull Text:PDF
GTID:2180330485955428Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
In today’s society, network leak and network fraud frequent happen, network security problem that nots allow to ignore. Cryptography is the foundation of network security, and is the primary means for information security; And secure authentication key agreement protocol is a message exchange protocol based on cryptography, its purpose is to provide users with all kinds of security services in the network environment.Chaos and cryptography have a natural connection. Chaos is a special form of motion. It means that in a certain nonlinear system, with no need for any random factors also can appear similar to the behavior of random phenomena. Chaotic system has the characteristics of certaint、boundednes、sensibility to initial parameters and unpredictability, etc. As the characteristics of chaotic system and cryptosystem are similar, chaos theory has widely noted by cryptographic circle, and chaotic system has opened up a new way for cryptography technique research. In Chaotic system, the chaotic sequence produced by chaos has the nature of non-periodicity and pseudo-randomness. Chebyshev chaotic maps, as a kind of the chaotic sequence, has the unique semi-group property which can be based on the difficult question assumptions of the Chaotic Maps-based Discrete Logarithm problem and the Chaotic Maps-Based Diffie–Hellman problem, builds a new asymmetric cryptosystem, establishes safety authentication key agreement protocols based on it, and then make them suitable for a variety of architectures for higher security requirements. Therefore, in this paper mainly studies polymorphic authentication key agreement protocols based on Chebyshev chaotic maps, the main research results as follows:1. According to the operation cost problem in elliptic curve cryptosystem, firstly puts forward a multi-server authentication key agreement protocol based on chaotic maps. The proposed protocol constructs a new kind of hybrid encryption algorithm based on chaotic maps by combineing with symmetric cryptography and asymmetric cryptography to realize messaging、mutual authentication and key agreement between the entities; effectively avoids modular exponentiation and scalar multiplication on an elliptic curve, reduces costs, improves efficiency.2. According to the operation cost problem and relatively single function problem in the new proposed hybrid cryptosystem, puts forward a chaotic maps-based authentication key agreement protocol with privacy protection. In the proposed protocol, chaos theory is only used to realize mutual authentication and key agreement; one-way Hash functions is used to transmit messages; the proposed protocol can provide privacy protection; And it works out the problem which is existing in the hybrid cryptosystem of “1”.3. In view of the relatively limited application environment problem in the proposed protocol of “2”, puts forward a provable multi-server authentication key agreement protocol with privacy preserving on chaotic maps cryptosystem. The proposed protocol can be applied to multi-server environment and have a more practical.
Keywords/Search Tags:Chebyshev chaotic maps, polymorphic, privacy preserving
PDF Full Text Request
Related items