Adapting Density Attacks to Low-Weight Knapsacks

DOI10.1007/11593447_3zbMath1142.94354OpenAlexW1554159452MaRDI QIDQ5451063

Jacques Stern, Phong Q. Nguyen

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)

Related Items (10)

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

Uses Software

• NTRU

This page was built for publication: Adapting Density Attacks to Low-Weight Knapsacks