January 01, 2006 conference-paper Open access Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices Lecture notes in computer science DOI: 10.1007/11681878_8 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 229 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 Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time 2021 Journal of the ACM article Computer Science Cryptography and Data Security Open access 20 citations Practical Product Proofs for Lattice Commitments 2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 60 citations 4 results References 0