Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

Edon- $ℛ (256, 384, 512)$ – an efficient implementation of Edon- $ℛ$ family of cryptographic hash functions

Danilo Gligoroski; Svein Johan Knapskog — 2008

Commentationes Mathematicae Universitatis Carolinae

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...

Page 1

Download Results (CSV)

Advanced Search

Formula preview

Currently displaying 1 – 1 of 1

Edon- ℛ ( 256 , 384 , 512 ) – an efficient implementation of Edon- ℛ family of cryptographic hash functions

Edon- $ℛ (256, 384, 512)$ – an efficient implementation of Edon- $ℛ$ family of cryptographic hash functions