CryptoDB
Edon--${\cal R}(256,384,512)$ -- an Efficient Implementation of Edon--${\cal R}$ Family of Cryptographic Hash Functions
Authors: | |
---|---|
Download: | |
Abstract: | We have designed three fast implementations of recently proposed family of hash functions Edon--${\cal R}$. They produce message digests of length 256, 384 and 512 bits. We have defined huge quasigroups of orders $2^{256}$, $2^{384}$ and $2^{512}$ by using only bitwise operations on 32 bit values (additions modulo $2^{32}$, 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. |
BibTeX
@misc{eprint-2007-13436, title={Edon--${\cal R}(256,384,512)$ -- an Efficient Implementation of Edon--${\cal R}$ Family of Cryptographic Hash Functions}, booktitle={IACR Eprint archive}, keywords={hash function, Edon--${\cal R}$, quasigroup}, url={http://eprint.iacr.org/2007/154}, note={ gligoroski@yahoo.com 13708 received 27 Apr 2007, last revised 14 Jul 2007}, author={Danilo Gligoroski and Svein Johan Knapskog}, year=2007 }