May 28, 2013 conference-paper Classical hardness of learning with errors ACM Symposium on Theory of Computing (STOC) DOI: 10.1145/2488608.2488680 OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 628 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access 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 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 3 results References 0