Author of the publication

The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices.

, , and . Electron. Colloquium Comput. Complex., (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Slide Reduction, Revisited - Filling the Gaps in SVP Approximation., , , and . CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, page 274-295. Springer, (2020)Recursive lattice reduction - A framework for finding short lattice vectors., , , and . CoRR, (2023)On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity., , , , , and . Electron. Colloquium Comput. Complex., (2023)A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic.. CCC, volume 137 of LIPIcs, page 11:1-11:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again!, , and . FOCS, page 563-582. IEEE Computer Society, (2015)On the Lattice Distortion Problem., , and . ESA, volume 57 of LIPIcs, page 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Gaussian Measure Over Lattices.. New York University, USA, (2017)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , and . SODA, page 1816-1835. SIAM, (2021)Extractor Lower Bounds, Revisited., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices., , and . Electron. Colloquium Comput. Complex., (2024)