Efficiency and Pseudo-Randomness of a Variant of Zemor-Tillich Hash Function
In this paper, the authors present a new provable cryptographic hash function that is twice as fast as zemor and tillich hash function and has enhanced security properties. They proposed optimal parameters and algorithms for both ZT hash and their construction, and analyzed the pseudo-randomness properties of their function. A careful implementation of the hash function allows for performances within a factor 23 of SHA-256 for an equivalent level of security (127 bit polynomial), and only 6.5 for SHA-512 (251 bit polynomial). Their hashing scheme H passes all tests in the ent and dieharder test suites without exhibiting any particular behavior.