You are looking at a specific version 20070714:180239 of this paper. See the latest version.

Paper 2007/154

Edon--${\cal R}(256,384,512)$ -- an Efficient Implementation of Edon--${\cal R}$ Family of Cryptographic Hash Functions

Danilo Gligoroski and Svein Johan Knapskog

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.

Note: Clarification what type of symmetric non-balanced block designs are used in the construction of the quasigroups is added.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functionEdon--${\cal R}$quasigroup
Contact author(s)
gligoroski @ yahoo com
History
2007-07-14: last of 7 revisions
2007-05-07: received
See all versions
Short URL
https://ia.cr/2007/154
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.