An Improved Hashing Algorithm Based On Chaotic Map And Its Application In Key Agreement Protocol

Along with the improvement of computer operation speed and development ofcryptanalysis, cryptography will face unprecedented challenges. Two world-class hashalgorithms have been cracked, designing a new hash function has become research focus incryptography. Chaotic mapping has various properties which the hash function required,and has good cryptographic properties, it provides a design idea to constructing a new hashfunction, in addition, also can be used as a candidate of cryptographic algorithm. Thetraditional cryptography usually use linear transformation to construct the algorithm, asbeing a nonlinear science, the theory of chaos will bring innovation for cryptography.Chaos theory has great application prospects in the field of information security.At the beginning of this paper, a new security concept of trusted computingtechnology is briefly described, and then, characteristics of the chaotic map is deeplyanalyzed, on account of the cycle become short for chaotic maps in finite precisioncomputing, we researched a generalized chaotic map, experimental results shows that itcan avoid the above problems. Several different control conditions are combined to effectthe chaotic maps switching strategy, this makes diffusion and confusion to plaintext.Simulation experiments are used to carried out various of tests for this algorithm, testresults show that the improved hash algorithm has good sensitivity, anti-collision andsafety.Finally, the hash algorithm is applied to a key agreement protocol. On account ofCertificate Authority’s Shortcoming in network communication, we use a dynamic publickey cryptography algorithm to construct a simple key agreement protocol. The randomnumbers which generated by both sides of communication are transmitted from each other,being used to changing keys of public key algorithm dynamically, this method achieves theone-time pad in the communication, it makes more efficiency than the method whichregenerate the large prime numbers to change the keys, three techniques which arecommonly used on the network attack are used to verifying the safety of this agreement.