초록
영어
A new hash algorithm with private key is proposed based on chaotic‐mapping, by reshaping
a piece‐wise linear chaotic mapping. This algorithm based on the cipher block chain mode
makes the iteration initial point as the private key, encrypts arbitrary length plaintext data to
128 bits hash value. The proposed algorithm encrypts multi‐bit at one time, which reduces the
chaotic iterating times and improves the encryption speed. Through theoretical analysis
and simulation results, the proposed hash function could satisfy the requirements of unidirectionality, initial value and key sensitivity, anti‐collision and real time, which could be applied to the identity authentication conveniently, safely and efficiently.
목차
Abstract
1. Introduction
2. Piece‐wise Linear Chaotic Mapping
3. the Encryption Procedure of HashFunction
4. Analysis on the Security and Efficiencyof the Proposed Algorithm
4.1 Analysis on the Sensitivity of the Initial Value
4.2 Analysis on Anti‐collision of the Proposed Algorithm
5. Application of Hash Function in IdentityCertification
5.1 Production and Distribution of the Private Key
5.2 Security of the Session Key
6. Conclusion
References
1. Introduction
2. Piece‐wise Linear Chaotic Mapping
3. the Encryption Procedure of HashFunction
4. Analysis on the Security and Efficiencyof the Proposed Algorithm
4.1 Analysis on the Sensitivity of the Initial Value
4.2 Analysis on Anti‐collision of the Proposed Algorithm
5. Application of Hash Function in IdentityCertification
5.1 Production and Distribution of the Private Key
5.2 Security of the Session Key
6. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보