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.

Citations

1404	How to share a secret - Shamir - 1979
476	Practical Byzantine fault tolerance - Castro, Liskov - 1999
184	Lower bounds for discrete logarithms and related problems - Shoup - 1997
177	Rethinking Public Key Infrastructures and Digital Certificates; Building in Privacy - Brands
124	Parallel collision search with cryptanalytic applications - Oorschot, Wiener - 1999
119	Proactive recovery in a byzantine-fault-tolerant system - CASTRO, LISKOV - 2000
113	A sieve algorithm for the shortest lattice vector problem - Ajtai, Kumar, et al. - 2001
69	D.: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost - Bellare, Micciancio - 1997
66	Fast Correlation Attacks on Certain Stream Ciphers - Meier, Staffelbach - 1989
64	Complexity of a determinate algorithm for the discrete logarithm - Nechaev
48	2000 ‘Improved fast correlation attacks using parity-check equations of weight 4 - Canteaut, Trabbia
40	M.: On monotone formula closure of SZK - Santis, Crescenzo, et al. - 1994
31	Smeets, “A Simple Algorithm for Fast Correlation Attacks on - Chepyzhov, Johansson, et al.
31	Software Generation of Practically Strong Random Numbers - Gutmann - 1998
24	Fast Correlation Attacks through Reconstruction - Johansson, Jönsson - 2000
24	Security of Blind Discrete Log Signatures Against Interactive Attacks - Schnorr - 2001
21	Fast Correlation Attacks: An Algorithmic Point of View - Joux, Chose, et al. - 2002
21	Black box cryptanalysis of hash networks based on multipermutations - Schnorr, Vaudenay - 1995
19	Why textbook ElGamal and RSA encryption are insecure - Boneh, Joux, et al. - 2000
19	The Art of Computer Programming, Vol 3 - Knuth - 1973
17	The knapsack hash function proposed at Crypto 1989 can be broken - Camion, Patarin - 1989
16	A Low-Complexity and HighPerformance Algorithm for the Fast - Mihalević, Fossorier, et al. - 2001
12	Pra, private communication - Boudou, Dai - 2004
12	Embedded security for network-attached storage - Gobioff, Nagle, et al. - 1999
9	Enumerating solutions to p(a)+q(b) = r(c)+s(d - Bernstein - 1999
9	Security analysis of the Gennaro-HaleviRabin signature scheme - Coron, Naccache - 2000
9	On the need for multipermutations - Vaudenay - 1994
7	Enhancing privacy and trust - Huberman, Franklin, et al. - 1999
6	Computation of low-weight parity-check polynomials - Golić - 1981
5	Proofs of partial knowledge and simpli ed design of witness hiding protocols - Cramer, Damgard, et al. - 1994
5	Security for a High Performance Commodity Storage Subsystem - Gobio - 1999
5	Chinese & Match', an alternative to Atkin's `Match and Sort' method used in the SEA algorithm - Joux, Lercier - 1999
5	Computation of low-weight parity checks for correlation attacks on stream ciphers - Penzhorn, Kühn - 1995
4	How easy is collision search? Application to DES (extended summary - Quisquater, Delescaille - 1989
4	A Systematic Procedure for Applying Fast Correlation Attacks to Combiners with Memory - Salmasizadeh, Golic, et al.
4	Trust but Check: Mutable Objects in Untrusted Cooperative Caches - Shrira, Yoder - 1998
3	On learning correlated functions using statistical query - Yang - 2001
2	Security Comments on the Hwang-Chen Algebraic-code Cryptosystem - Alabbadi - 1997
2	Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining - Goi, Siddiqi, et al. - 2001
2	Secure Human Identi Protocols - Hopper, Blum - 2001
2	A TS = O(2 n ) Time/Space Tradeo for Certain NPComplete Problems - Schroeppel, Shamir - 1979
2	A complete problems - Schroeppel, Shamir - 1981
2	Parallel Collision Search: Making money the old-fashioned way|the NOW as a cash cow," unpublished report - Wagner, Goldberg - 1997
1	Non-transferable signatures," ietf-open-pgp mailing list - Back
1	On the generation of DSA one-time keys," unpublished manuscript - Bleichenbacher - 2002
1	A study on the proposed - Lim, Lee - 1998
1	Algebraic-code cryptosystem using random code chaining - Hwang, Chen - 1990
1	A Generalized Birthday Problem," Full version at http://www.cs.berkeley.edu/~daw/papers/genbday.html - Wagner
1	How to Swindle Rabin," Cryptologia - Yuval - 1979