A Generalized Birthday Problem

@inproceedings{Wagner2002AGB,
  title={A Generalized Birthday Problem},
  author={David A. Wagner},
  booktitle={CRYPTO},
  year={2002}
}
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… Expand
A Generalized Birthday Problem (Extended Abstract)
Correction to: Optimal Merging in Quantum k-xor and k-sum Algorithms
Towards factoring in SL ( 2 , F 2 n )
The Extended k-tree Algorithm
Finding Low Weight Polynomial Multiples Using Lattices
Improved Quantum Algorithms for the k-XOR Problem
Refinements of the k-tree Algorithm for the Generalized Birthday Problem
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers
Black Box Cryptanalysis of Hash Networks Based on Multipermutations
Lower Bounds for Discrete Logarithms and Related Problems
  • V. Shoup
  • Mathematics, Computer Science
  • EUROCRYPT
  • 1997
Fast Correlation Attacks: An Algorithmic Point of View
A TcS2 = 0 (2n) time/space tradeoff for certain NP-complete problems
  • R. Schroeppel, A. Shamir
  • Computer Science
  • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers
On Learning Correlated Boolean Functions Using Statistical Queries
  • K. Yang
  • Mathematics, Computer Science
  • ALT
  • 2001
A sieve algorithm for the shortest lattice vector problem
"Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm
...
1
2
3
4
...