Collision analysis of a parallel keyed hash function based on chaotic neural network

The security of a parallel keyed hash function based on two-layer neural network is investigated. The collision examples and the theoretical analysis show that the original algorithm is insecure. An improved hash function is proposed. Theoretical analysis and simulation experiments indicate that the improved algorithm is more secure, keeping the parallel merit of the original hash function.