Practical analysis of key recovery attack against search-LWE problem

DOI10.1007/978-3-319-44524-3_10MaRDI QIDQ1800677zbMATH OpenOpenAlexFDO

Authors Momonari Kudo, Junpei Yamaguchi, Yang Guo, Masaya Yasuda

Publication date 24 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-44524-3_10

zbMATH Keywords

LWElattice reductionBabai's nearest plane method

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
• Better key sizes (and attacks) for LWE-based encryption
• On the asymptotic complexity of solving LWE
• On the complexity of the BKW algorithm on LWE
• On the concrete hardness of learning with errors

Cited in

(7)

• scientific article; zbMATH DE number 1617935 (Why is no real title available?)
• Better key sizes (and attacks) for LWE-based encryption
• A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
• Solving LWR via BDD Strategy: Modulus Switching Approach
• Attacks on the Search RLWE Problem with Small Errors
• A trace map attack against special ring-LWE samples
• How to find ternary LWE keys using locality sensitive hashing

This page was built for publication: Practical analysis of key recovery attack against search-LWE problem

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