Wagner’s algorithm for the generalized birthday problem
E1913646
UNEXPLORED
Wagner’s algorithm for the generalized birthday problem is a cryptographic technique that efficiently finds collisions in generalized birthday problems by combining many partial solutions in a structured, tree-like manner.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Wagner’s algorithm for the generalized birthday problem canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.