Improved low-memory subset sum and LPN algorithms via multiple collisions

DOI10.1007/978-3-030-35199-1_9zbMath1454.94063OpenAlexW2970041775MaRDI QIDQ2177659

Claire Delaplace, Andre Esser, Alexander May

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35199-1_9

zbMATH Keywords

representationsparallel collision searchtime-memory trade-off

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (6)

Making the BKW algorithm practical for LWE ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ 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 ⋮ Parallel isogeny path finding with limited memory ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications

This page was built for publication: Improved low-memory subset sum and LPN algorithms via multiple collisions