Edon-$\Cal R (256,384,512)$ -- an efficient implementation of Edon-$\Cal R$ family of cryptographic hash functions
Danilo Gligoroski, Svein J. Knapskog · Czech digital mathematics library · 2008
summary:We have designed three fast implementations of a recently proposed family of hash functions Edon--$\Cal R$. They produce message digests of length $n=256, 384, 512$ bits and project security of $2^{\frac{n}{2}}$ hash computations for finding collisions and $2^{n}$ hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damg\aa rd but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders $2^{256}$, $2^{384}$ and $2^{512}$ that are constructed by using only bitwise operations on 32 bit values (additions modulo $2^{32}$, XORs and left rotations). Initial Reference C code achieves processing speeds of 16.18 cycles/byte, 24.37 cycles/byte and 32.18 cycles/byte on x86 (Intel and AMD microprocessors). In this paper we give their full description, as well as an initial security analysis.