Cryptanalysis of a knapsack-based probabilistic encryption scheme
From MaRDI portal
Publication:730959
DOI10.1016/j.ins.2009.05.015zbMath1170.94336OpenAlexW2094303942WikidataQ121264585 ScholiaQ121264585MaRDI QIDQ730959
Publication date: 1 October 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.05.015
cryptanalysispublic key cryptographyDiophantine equationslattice basis reductionknapsack cryptosystem
Related Items
Cryptanalysis of a quadratic compact knapsack public-key cryptosystem, Preimage selective trapdoor function: how to repair an easy problem, Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- A knapsack-based probabilistic encryption scheme
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- New Definition of Density on Knapsack Cryptosystems
- An Improved Low-Density Subset Sum Algorithm
- Adapting Density Attacks to Low-Weight Knapsacks
- Hiding information and signatures in trapdoor knapsacks