The Analysis for a Chaos-Based One-Way Hash Algorithm

Abstract

Chaotic maps can be used in constructing hash function because of their properties, such as parameter-sensitivity and random-similarity. Many algorithms have been proposed for chaos-based one-way hash function. However, how to map bit strings into decimal number is ignored by these algorithms. The Analysis for a chaos-based one-way hash algorithm shows that it is a very important problem. Probably, selecting an inappropriate map will result in the collision of hash values. A non-linear map method is presented. The computing result shows that it is valid.