Abstract: In this paper, a novel hash algorithm based on chaos is proposed to overcome the flaws of the corresponding algorithms in [4, 5]. Its security can be guaranteed, and it can work efficiently in a parallel way. Furthermore, the algorithm structure can ensure the uniform sensitivity of final hash value to the message blocks at different positions of the whole message. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot