Cayley Hashes : A Class of Efficient Graph-based Hash Functions

@inproceedings{Petit2008CayleyH,
  title={Cayley Hashes : A Class of Efficient Graph-based Hash Functions},
  author={Christophe Petit and Kristin E. Lauter and Jean-Jacques Quisquater},
  year={2008}
}
Hash functions are widely used in cryptography. Recent breakthroughs against the standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm, SHA-3 [1]. Provably secure hash functions, that is functions whose security reduces to a simply-stated, supposedly hard mathematical problem, are widely believed to be much too slow for the NIST competition. In this paper, we discuss Cayley hashes, a class of efficient and provably secure hash functions constructed from the Cayley… CONTINUE READING
6 Citations
23 References
Similar Papers

References

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

Similar Papers

Loading similar papers…