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

DOI10.1007/3-540-46416-6_3MaRDI QIDQ4037448zbMATH OpenOpenAlexFDO

Authors 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

hash functionsknapsackprobabilistic algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1088903
• scientific article; zbMATH DE number 691485
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• scientific article; zbMATH DE number 1024104
• scientific article; zbMATH DE number 3910295

Cited in

(8)

• scientific article; zbMATH DE number 3910295 (Why is no real title available?)
• The extended \(k\)-tree algorithm
• Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
• Theory of Cryptography
• Improved quantum algorithms for the k-XOR problem
• Really fast syndrome-based hashing
• Decoding one out of many
• Improved combinatorial algorithms for the inhomogeneous short integer solution problem

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

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