Nearest planes in practice

DOI10.1007/978-3-319-21356-9_14MaRDI QIDQ2947117zbMATH OpenOpenAlexFDO

Authors Christian H. Bischof, Özgür Dagdelen, Robert Fitzpatrick, Florian Göpfert, Artur Mariano, Johannes Buchmann

Publication date 21 September 2015

Published in Cryptography and Information Security in the Balkans (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21356-9_14

zbMATH Keywords

cryptanalysisdecoding attackimplementationlatticesnearest planes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
• Better algorithms for LWE and LWR
• On the concrete hardness of learning with errors
• A sieve algorithm based on overlattices
• Finding closest lattice vectors using approximate Voronoi cells

Cited in

(3)

• Half nearfield planes
• Solving LWR via BDD Strategy: Modulus Switching Approach
• Biplanes and near biplanes

This page was built for publication: Nearest planes in practice

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