Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function

@article{Petit2008EfficiencyAP,
  title={Efficiency and pseudo-randomness of a variant of Z{\'e}mor-Tillich hash function},
  author={Christophe Petit and Nicolas Veyrat-Charvillon and Jean-Jacques Quisquater},
  journal={2008 15th IEEE International Conference on Electronics, Circuits and Systems},
  year={2008},
  pages={906-909}
}
Recent breakthroughs concerning the current standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm by X.Wang et al (2005). Provably secure hash functions (in the sense that their security relates to the hardness of some mathematical problems by V. Lyubashevsky et al (2006) are particularly interesting from a theoretical point of view but are often much slower than heuristic functions like SHA. In this paper, we consider a variant of ZT hash, a provably secure hash… CONTINUE READING

Similar Papers

Loading similar papers…