Adapting Density Attacks to Low-Weight Knapsacks
From MaRDI portal
Publication:5451063
DOI10.1007/11593447_3zbMATH Open1142.94354OpenAlexW1554159452MaRDI QIDQ5451063FDOQ5451063
Authors: Phong Q. Nguyen, Jacques Stern 
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_3
Recommendations
- Low-density attack revisited
- Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems
- New attacks for knapsack based cryptosystems
- scientific article; zbMATH DE number 1088903
- New Definition of Density on Knapsack Cryptosystems
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- A critical analysis of the security of knapsack public-key algorithms
- Solving low density knapsacks
- scientific article; zbMATH DE number 4087587
- Low-Data Complexity Attacks on AES
Cited In (10)
- Predicting Lattice Reduction
- Quadratic compact knapsack public-key cryptosystem
- Cryptanalysis of a knapsack-based probabilistic encryption scheme
- Lattice Reduction for Modular Knapsack
- A knapsack-based probabilistic encryption scheme
- Solving low-density multiple subset sum problems with SVP oracle
- Improved broadcast attacks against subset sum problems via lattice oracle
- Improvements in the analysis of Kannan's CVP algorithm
- New Definition of Density on Knapsack Cryptosystems
- Preimage selective trapdoor function: how to repair an easy problem
Uses Software
This page was built for publication: Adapting Density Attacks to Low-Weight Knapsacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451063)
