Advanced Search

We have designed three fast implementations of a recently proposed family of hash functions Edon–$ℛ$. 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å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...