Parallel hash function construction based on coupled map lattices》.pdfVIP

Commun Nonlinear Sci Numer Simulat 16 (2011) 2810–2821 Contents lists available at ScienceDirect Commun Nonlinear Sci Numer Simulat journal homepage: www.else /locate/cnsns Parallel hash function construction based on coupled map lattices Yong Wang a,b,c,⇑, Kwok-Wo Wong b, Di Xiao c a Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065, China b Department of Electronic Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong c College of Computer Science and Engineering, Chongqing University, Chongqing 400044, China a r t i c l e i n f o a b s t r a c t Article history: In this paper, the parallel structure of hash function is analyzed. Then, a parallel hash func- Received 3 May 2010 tion based on coupled map lattices is proposed. The message is partitioned into blocks with Received in revised form 20 September fixed length. The message block is firstly processed by the hash round function. The final 2010 hash value is the mixed result of all the outputs of the hash round functions. The hash Accepted 1 October 2010 Available online 16 October 2010 round functions are mainly implemented by the coupled map lattices and can work in a parallel mode, which guarantees good security and high efficiency. Theoretic analyses and numerical simulations both show that the proposed hash algorithm possesses good Keywords: Hash function