Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction

DOI10.3934/AMC.2022082MaRDI QIDQ6584316zbMATH OpenFDO

Authors Neal Koblitz, Subhabrata Samajder, Palash Sarkar, Subhadip Singha

Publication date 6 August 2024

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2022082

zbMATH Keywords

concrete analysisideal latticesring learning with errorsshortest vector problem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Classical reduction of gap SVP to LWE: a concrete security analysis
• Concrete security from worst-case to average-case lattice reductions
• Worst-case to average-case reductions for module lattices
• On the shortness of vectors to be found by the ideal-SVP quantum algorithm
• Short Stickelberger class relations and application to Ideal-SVP

Cites work

• A decade of lattice cryptography
• Algebraically structured LWE. Revisited
• Another look at tightness. II: Practical issues in cryptography
• Classical hardness of learning with errors
• Efficient public key encryption based on ideal lattices (extended abstract)
• Finding shortest lattice vectors faster using quantum search
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 46578 (Why is no real title available?)
• scientific article; zbMATH DE number 1304296 (Why is no real title available?)
• Making NTRU as secure as worst-case problems over ideal lattices
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
• New bounds in some transference theorems in the geometry of numbers
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the limits of nonapproximability of lattice problems
• Probability Inequalities for Sums of Bounded Random Variables
• Provably secure NTRU instances over prime cyclotomic rings
• Pseudorandomness of ring-LWE for any ring and modulus
• Public-key cryptosystems from the worst-case shortest vector problem
• Quantum computation and quantum information. 10th anniversary edition
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Ring-LWE in polynomial rings
• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• Verifying solutions to LWE with implications for concrete security
• Worst-case to average-case reductions for module lattices

This page was built for publication: Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584316)