Memoryless near-collisions, revisited

DOI10.1016/J.IPL.2012.11.004zbMath1259.94050arXiv1209.4255OpenAlexW2082595508MaRDI QIDQ1943608

Elmar Teufl, Mario Lamberger

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4255

zbMATH Keywords

cryptographycovering codeshash functionsmemoryless near-collisions

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Time-Memory Trade-Offs for Near-Collisions ⋮ Solving LPN using covering codes

This page was built for publication: Memoryless near-collisions, revisited