Adapting Density Attacks to Low-Weight Knapsacks

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

zbMATH Keywords

LatticesKnapsackSubset SumPublic-Key Cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

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)

• New Definition of Density on Knapsack Cryptosystems
• Quadratic compact knapsack public-key cryptosystem
• Improved broadcast attacks against subset sum problems via lattice oracle
• A knapsack-based probabilistic encryption scheme
• Lattice Reduction for Modular Knapsack
• Preimage selective trapdoor function: how to repair an easy problem
• Solving low-density multiple subset sum problems with SVP oracle
• Cryptanalysis of a knapsack-based probabilistic encryption scheme
• Predicting Lattice Reduction
• Improvements in the analysis of Kannan's CVP algorithm

Describes a project that uses

Uses Software

• NTRU

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)