Cryptology ePrint Archive: Report 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.

Category / Keywords: hash function, Edon--${\cal R}$, quasigroup

Date: received 27 Apr 2007, last revised 14 Jul 2007

Contact author: gligoroski at yahoo com

Available format(s): PDF | BibTeX Citation

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

Version: 20070714:180239 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]