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

• A practical attack against knapsack based hash functions. (Extended abstract)
• scientific article; zbMATH DE number 691485
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• Collisions and inversions for Damgård's whole hash function
• scientific article; zbMATH DE number 3910295

Cited in

(12)

• Improved combinatorial algorithms for the inhomogeneous short integer solution problem
• Optimal merging in quantum k-xor and k-sum algorithms
• Really fast syndrome-based hashing
• Decoding one out of many
• scientific article; zbMATH DE number 3910295 (Why is no real title available?)
• The extended \(k\)-tree algorithm
• Collisions and inversions for Damgård's whole hash function
• A practical attack against knapsack based hash functions. (Extended abstract)
• Theory of Cryptography
• Improved quantum algorithms for the k-XOR problem
• Fine-grained cryptanalysis: tight conditional bounds for dense \(k\)-SUM and \(k\)-XOR
• SoK: on the security of cryptographic problems from linear algebra

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)