DocumentCode :
2200097
Title :
An Extensible Hash Function Construction Based on Embedded Chaos Maps
Author :
Zhang, Xiaohong ; Yang, Yixian ; Li, Lixiang ; Peng, Haipeng
Author_Institution :
Inf. Security Center, Beijing Univ. of Posts & Telecommun., Beijing, China
fYear :
2010
fDate :
June 29 2010-July 1 2010
Firstpage :
2407
Lastpage :
2414
Abstract :
Based on chaotic Tent map, this paper proposed a new 5×L (L≥32) bits extensible Hash function with symmetric keys. The structure only performed Boolean algorithm and shift operation. In order to generate fast diffusion, confusion and avalanche effect, Chaos series were embedded in the whole algorithm. The security against statistical attack, birthday attack were analyzed in detail. Many simulations were shown that the Hash value was highly sensitive to initial condition and parameter, and also to a message bit. Performance comparisons with MD5 showed that this scheme was a feasible scheme, and can be applied in e-commerce.
Keywords :
Boolean algebra; chaotic communication; computer network security; cryptography; Boolean algorithm; Chaos series; avalanche effect; confusion; embedded chaos maps; extensible Hash function; fast diffusion; security analysis; shift operation; Bismuth; Chaotic communication; Computers; Cryptography; Sensitivity; Hash function; chaos maps; embedded scheme; security analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location :
Bradford
Print_ISBN :
978-1-4244-7547-6
Type :
conf
DOI :
10.1109/CIT.2010.414
Filename :
5578295
Link To Document :
بازگشت