Optimal Hash Functions for Approximate Matches on the n-Cube

DOI10.1109/TIT.2009.2039037MaRDI QIDQ5281561zbMATH OpenOpenAlexFDO

Authors Daniel M. Gordon, Victor S. Miller, Peter Ostapenko

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2009.2039037

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited in

(4)

• Identifying an unknown code by partial Gaussian elimination
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Optimal covering codes for finding near-collisions
• Memoryless near-collisions via coding theory

This page was built for publication: Optimal Hash Functions for Approximate Matches on the $n$-Cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281561)