( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice.

, , , и . IACR Cryptol. ePrint Arch., (2021)

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.

Hans Noah

Owen Stephens

Elizabeth Stephens

Frauke Christine Noah

Ernst Magnus Noah

 

Другие публикации лиц с тем же именем

Slide Reduction, Revisited - Filling the Gaps in SVP Approximation., , , и . CRYPTO (2), том 12171 из Lecture Notes in Computer Science, стр. 274-295. Springer, (2020)Recursive lattice reduction - A framework for finding short lattice vectors., , , и . CoRR, (2023)On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity., , , , , и . Electron. Colloquium Comput. Complex., (2023)A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic.. CCC, том 137 из LIPIcs, стр. 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!, , и . FOCS, стр. 563-582. IEEE Computer Society, (2015)On the Lattice Distortion Problem., , и . ESA, том 57 из LIPIcs, стр. 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)., , , и . SODA, стр. 1816-1835. SIAM, (2021)Extractor Lower Bounds, Revisited., , , , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 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., , и . Electron. Colloquium Comput. Complex., (2024)