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

DOI10.1007/978-981-99-7563-1_4MaRDI QIDQ6550643FDOQ6550643

Authors: Timo Glaser, Alexander May 

Publication date: 5 June 2024

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

zbMATH Keywords

asymptoticsrepresentation techniqueLWE key search

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (4)

• 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
• Memory-efficient attacks on small LWE keys

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)