A Generalized Birthday Problem

  title={A Generalized Birthday Problem},
  author={David A. Wagner},
We study a k-dimensional generalization of the birthday problem: given k lists of n-bit values, find some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely well-known birthday problem, which has a square-root time algorithm with many applications in cryptography. In this paper, we show new algorithms for the case k > 2: we show a cube-root time algorithm for the case of k = 4 lists, and we give an algorithm with… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 416 citations. REVIEW CITATIONS



Citations per Year

417 Citations

Semantic Scholar estimates that this publication has 417 citations based on the available data.

See our FAQ for additional information.