Dissection-BKW

DOI10.1007/978-3-319-96881-0_22MaRDI QIDQ1784110zbMATH OpenOpenAlexFDO

Authors Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler

Publication date 26 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96881-0_22

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1229395
• scientific article; zbMATH DE number 1896100
• Dissecting EXIT
• Hinged dissections exist

Cited in

(13)

• Optimal merging in quantum k-xor and k-sum algorithms
• Making the BKW algorithm practical for LWE
• Improved low-memory subset sum and LPN algorithms via multiple collisions
• scientific article; zbMATH DE number 1229395 (Why is no real title available?)
• Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
• A non-heuristic approach to time-space tradeoffs and optimizations for BKW
• Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
• An iterative correction method for practically LPN solving
• Memory-efficient attacks on small LWE keys
• Asymptotics and improvements of sieving for codes
• Memory-efficient BKW algorithm for solving the LWE problem
• Optimizing c-sum BKW and faster quantum variant for LWE
• Noisy Simon period finding

This page was built for publication: Dissection-BKW

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