The Knapsack Hash Function proposed at Crypto’89 can be broken

DOI10.1007/3-540-46416-6_3zbMath0789.68046OpenAlexW1607206152MaRDI QIDQ4037448

Paul Camion, Jacques Patarin

Publication date: 18 May 1993

Published in: Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-46416-6_3

zbMATH Keywords

probabilistic algorithmknapsackhash functions

Mathematics Subject Classification ID

Cryptography (94A60) Randomized algorithms (68W20)

Related Items (5)

The extended \(k\)-tree algorithm ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Really Fast Syndrome-Based Hashing ⋮ Decoding One Out of Many ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms

This page was built for publication: The Knapsack Hash Function proposed at Crypto’89 can be broken