Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
From MaRDI portal
Publication:6584316
DOI10.3934/amc.2022082MaRDI QIDQ6584316
Subhabrata Samajder, Palash Sarkar, Subhadip Singha, Neal Koblitz
Publication date: 6 August 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding shortest lattice vectors faster using quantum search
- New bounds in some transference theorems in the geometry of numbers
- On the limits of nonapproximability of lattice problems
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Verifying solutions to LWE with implications for concrete security
- Algebraically structured LWE. Revisited
- Worst-case to average-case reductions for module lattices
- Another look at tightness. II: Practical issues in cryptography
- A Decade of Lattice Cryptography
- Ring-LWE in Polynomial Rings
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Quantum Computation and Quantum Information
- Efficient Public Key Encryption Based on Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- Public-key cryptosystems from the worst-case shortest vector problem
- Probability Inequalities for Sums of Bounded Random Variables
- On Ideal Lattices and Learning with Errors over Rings
- Classical hardness of learning with errors
- Provably Secure NTRU Instances over Prime Cyclotomic Rings
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
