One way Hash function construction based on chaotic mapping

The performance of one way Hash function was improved and new Hash function construction methods were proposed through a novel Hash method based on chaotic mapping. Two different chaotic models are used to construct one way Hash functions. The algorithm which is sensitive to the initial message is designed to either produce a pair of collision messages or recover a message to have the given Hash result (a forgery) computationally infeasible by hashing messages of arbitrary bit length into 128 bit Hash values. The advantages and potential of using chaotic mapping for one-way Hash functions were discussed. The simulation demonstrates the convenience, high sensitivity to initial values and good Hash performance of the new method. This method can be easily to be paralleled and the number of iterations is in direct proportion to the initial text length. The algorithm is a quick and easily implemented one-way Hash function.