How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}

DOI10.1007/978-981-99-7563-1_4MaRDI QIDQ6550643zbMATH OpenFDO

Authors Timo Glaser, Alexander May

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-981-99-7563-1_4

zbMATH Keywords

asymptoticsLWE key searchrepresentation technique

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Memory-efficient attacks on small LWE keys
• Memory-efficient attacks on small LWE keys
• How to meet ternary LWE keys
• Further improvements of the estimation of key enumeration with applications to solving LWE
• How to find ternary LWE keys using locality sensitive hashing

Cited in

(7)

• Memory-efficient attacks on small LWE keys
• Memory-efficient attacks on small LWE keys
• A refined hardness estimation of LWE in two-step mode
• Further improvements of the estimation of key enumeration with applications to solving LWE
• Fast slicer for Batch-CVP: making lattice hybrid attacks practical
• Quantum collision search for ternary LWE keys
• Designs for practical SHE schemes based on Ring-LWR

This page was built for publication: How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}

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