Book Chapter
A practical attack against knapsack based hash functions
Extended abstract
Antoine Joux and Louis Granboulan
Lecture Notes in Computer Science, 1995, Volume 950, Advances in Cryptology — EUROCRYPT'94, Pages 58-66
Book Chapter
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
C. P. Schnorr and M. Euchner
Lecture Notes in Computer Science, 1991, Volume 529, Fundamentals of Computation Theory, Pages 68-85
Book Chapter
Adapting Density Attacks to Low-Weight Knapsacks
Phong Q. Nguyễn and Jacques Stern
Lecture Notes in Computer Science, 2005, Volume 3788, Advances in Cryptology - ASIACRYPT 2005, Pages 41-58
Book Chapter
Lattices and cryptography: An overview
Jacques Stern
Lecture Notes in Computer Science, 1998, Volume 1431, Public Key Cryptography, Pages 50-54
Book Chapter
New Definition of Density on Knapsack Cryptosystems
Noboru Kunihiro
Lecture Notes in Computer Science, 2008, Volume 5023, Progress in Cryptology – AFRICACRYPT 2008, Pages 156-173
Book Chapter
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
Changlin Wan and Zhongzhi Shi
Lecture Notes in Computer Science, 2008, Volume 5059, Frontiers in Algorithmics, Pages 300-310
Reference Work Entry
Knapsack cryptographic schemes
Yvo Desmedt
2005, Encyclopedia of Cryptography and Security, K, Pages 333-342
Journal Article
Attacking the Market Split Problem with Lattice Point Enumeration
Alfred Wassermann
Journal of Combinatorial Optimization, 2002, Volume 6, Number 1, Pages 5-16
Book Chapter
Lattice Reduction in Cryptology: An Update
Phong Q. Nguyen and Jacques Stern
Lecture Notes in Computer Science, 2000, Volume 1838, Algorithmic Number Theory, Pages 85-112
Book Chapter
Generalized Compact Knapsacks Are Collision Resistant
Vadim Lyubashevsky and Daniele Micciancio
Lecture Notes in Computer Science, 2006, Volume 4052, Automata, Languages and Programming, Pages 144-155