A Generalized Birthday Problem
Author:
Top Cited Papers
- 13 September 2002
- book chapter
- Published by Springer Nature
- p. 288-304
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Secure Human Identification Protocols2001
- On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract)2001
- Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑)Mathematics of Computation, 2000
- “Chinese & Match”, an alternative to Atkin’s “Match and Sort” method used in the SEA algorithmMathematics of Computation, 2000
- Parallel Collision Search with Cryptanalytic ApplicationsJournal of Cryptology, 1999
- Computation of low-weight parity-check polynomialsElectronics Letters, 1996
- Complexity of a determinate algorithm for the discrete logarithmMathematical Notes, 1994
- Fast correlation attacks on certain stream ciphersJournal of Cryptology, 1989
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete ProblemsSIAM Journal on Computing, 1981
- HOW TO SWINDLE RABINCryptologia, 1979