Edon-R, An Infinite Family of Cryptographic Hash Functions

@article{Gligoroski2009EdonRAI,
  title={Edon-R, An Infinite Family of Cryptographic Hash Functions},
  author={Danilo Gligoroski and Smile Markovski and Ljupco Kocarev},
  journal={I. J. Network Security},
  year={2009},
  volume={8},
  pages={293-300}
}
We propose a new infinite family of cryptographic hash functions, Edon–R, based on a recently defined candidate one-way function. Edon–R is a class of hash functions with variable output lengths. It is de­ fined using quasigroups and quasigroup string trans­ formations. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 35 references

On a Family of Minimal Candi­ date One-Way Functions and One-Way Permuta­ tions

  • D. Gligoroski
  • print, International Journal of Network Security…
  • 2005
Highly Influential
5 Excerpts

L

  • D. Gligoroski, S. Markovski
  • Ko­ carev and M. Gusev, “Edon80,” ECRYPT Stream…
  • 2005
1 Excerpt

Yin lision Search Attacks http://theory.csail.m ∼ yiqun/shanote.pdf and on it.edu/ H

  • Y. X. Wang
  • 2005
1 Excerpt