Edon-R(256, 384, 512) - an Efficient Implementation of Edon-R} Family of Cryptographic Hash Functions.
Danilo Gligoroski, Svein J. Knapskog · IACR Cryptology ePrint Archive · 2007
We have designed three fast implementations of recently proposed family of hash functions Edon–R. They produce message digests of length 256, 384 and 512 bits. We have defined huge quasigroups of orders 2, 2 and 2 by using only bitwise operations on 32 bit values (additions modulo 2, XORs and left rotations) and achieved processing speeds of the Reference C code 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.