Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
From MaRDI portal
Publication:6104345
DOI10.1007/978-3-031-15979-4_17zbMath1517.94069MaRDI QIDQ6104345
Alice Pellet-Mary, Erell Gachon, Katharina Boudgoust
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- On Lovász' lattice reduction and the nearest lattice point problem
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On the bit security of cryptographic primitives
- Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
- On the ideal shortest vector problem over random rational primes
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Approx-SVP in ideal lattices with pre-processing
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- Practical Signatures from the Partial Fourier Recovery Problem
- Fully homomorphic encryption using ideal lattices
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Number fields
This page was built for publication: Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
