Analysis and Implementation of a Fast Hash Function Based Upon Elliptic Curves
Source: Cyber Journals
Hash functions are probably the most popular component employed in cryptographic applications for their well known advantages they provide over digital communication links. Hash algorithms bearing the chaos and chaotic behaviors have attracted many attentions due to their full unpredictability. The proposed hash algorithm is based on elliptic functions with the employment of chaos and coupled map lattice with variable parameters. The floating point representation is used to prevent changing a message to different hash values in different environments. The paper results show that the proposed hash function has irreversibility, collision resistibility as well as sensitivity to initial values.