Key recovery attack on the partial Vandermonde knapsack problem
From MaRDI portal
Publication:6637720
Recommendations
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Cryptanalysis of a knapsack-based probabilistic encryption scheme
- New Definition of Density on Knapsack Cryptosystems
- New attacks for knapsack based cryptosystems
Cites work
- scientific article; zbMATH DE number 1346524 (Why is no real title available?)
- BKZ 2.0: Better lattice security estimates
- Decoding by Embedding: Correct Decoding Radius and DMT Optimality
- Factoring polynomials with rational coefficients
- LWE with side information: attacks and concrete security estimation
- On the concrete hardness of learning with errors
- On the hardness of the finite field isomorphism problem
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
- Practical signatures from the partial Fourier recovery problem
- Predicting Lattice Reduction
- Revisiting the expected cost of solving uSVP and applications to LWE
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
This page was built for publication: Key recovery attack on the partial Vandermonde knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637720)
