## A Generalized Birthday Problem (2002)

by
David Wagner

Venue: | In CRYPTO |

Citations: | 93 - 0 self |

### BibTeX

@INPROCEEDINGS{Wagner02ageneralized,

author = {David Wagner},

title = {A Generalized Birthday Problem},

booktitle = {In CRYPTO},

year = {2002},

pages = {288--303},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

We study a k-dimensional generalization of the birthday problem: given k lists of n-bit values, nd 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.