Pages that link to "Item:Q5281561"
From MaRDI portal
The following pages link to Optimal Hash Functions for Approximate Matches on the $n$-Cube (Q5281561):
Displaying 4 items.
- Memoryless near-collisions via coding theory (Q663464) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions (Q2945385) (← links)
- Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)