A Aralex Aachen research explorer

January 01, 2007 article

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

SIAM Journal on Computing

DOI: 10.1137/s0097539705447360 OpenAlex

Authors 0

Author list not loaded yet.

Cited by 6 stored of 912

Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$
2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

2

citations
Smoothing Codes and Lattices: Systematic Study and New Bounds
2023 IEEE Transactions on Information Theory article Computer Science Cryptography and Data Security Open access

13

citations
Finding Short Integer Solutions When the Modulus Is Small
2023 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

18

citations
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

67

citations
Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple
2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

61

citations
On the Quantum Complexity of the Continuous Hidden Subgroup Problem
2020 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

7

citations

6 results

References 0