Hash Function Balance and its Impact on Birthday Attacks

@article{Bellare2003HashFB,
  title={Hash Function Balance and its Impact on Birthday Attacks},
  author={Mihir Bellare and Tadayoshi Kohno},
  journal={IACR Cryptology ePrint Archive},
  year={2003},
  volume={2003},
  pages={65}
}
Textbooks tell us that a birthday attack on a hash function h with range size r requires r trials (hash computations) to find a collision. But this is quite misleading, being true only if h is regular, meaning all points in the range have the same number of pre-images under h; if h is not regular, fewer trials may be required. But how much fewer? This paper addresses this question by introducing a measure of the “amount of regularity” of a hash function that we call its balance, and then… CONTINUE READING
BETA

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 94 CITATIONS, ESTIMATED 25% COVERAGE

94 Citations

0510'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Hash function balance and its impact on birthday attacks

  • M. Bellare, T. Kohno
  • IACR ePrint archive,
  • 2003
Highly Influential
5 Excerpts

P

  • A. Menezes
  • van Oorschot and S. Vanstone. Handbook of applied…
  • 1997

Similar Papers

Loading similar papers…