CRYPTO : Claire Delaplace (Ruhr Uni Bochum) : Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
Bâtiment Descartes, salle 301For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a strong need for low-memory algorithms. We show that the combination of techniques from representations, multiple collision finding, and the Schroeppel-Shamir Algorithm leads to improved low-memory algorithms. For random