Solving LWR via BDD Strategy: Modulus Switching Approach

DOI10.1007/978-3-030-00434-7_18zbMath1518.94068OpenAlexW2888963890MaRDI QIDQ6104634

Dung Hoang Duong, Masaya Yasuda, Pradeep Kumar Mishra, Unnamed Author

Publication date: 28 June 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-00434-7_18

zbMATH Keywords

lattice basis reductionlearning with errors (LWE)modulus switchingBabai's nearest plane (BNP) algorithmbounded distance decoding (BDD) strategylearning with rounding (LWR)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Related Items (1)

Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem

Cites Work

• On the concrete hardness of learning with errors
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• A hybrid lattice basis reduction and quantum search attack on LWE
• Practical analysis of key recovery attack against search-LWE problem
• (Leveled) fully homomorphic encryption without bootstrapping
• Pseudorandom Functions and Lattices
• Nearest Planes in Practice
• New Algorithms for Learning in Presence of Errors
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Lattice-based Cryptography
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Lazy Modulus Switching for the BKW Algorithm on LWE
• Predicting Lattice Reduction
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Solving LWR via BDD Strategy: Modulus Switching Approach