A Aralex Aachen research explorer

January 01, 1987 article Open access

A hierarchy of polynomial time lattice basis reduction algorithms

Theoretical Computer Science

DOI: 10.1016/0304-3975(87)90064-8 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 6 stored of 661

Predicting Module-Lattice Reduction
2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

2

citations
Lattice Reduction via Dense Sublattices: A Cryptanalytic No-Go
2025 IACR Communications in Cryptology article Computer Science Cryptography and Data Security Open access

0

citations
Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
2023 Designs Codes and Cryptography article Computer Science Cryptography and Data Security Open access

9

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
Sparse recovery with integrality constraints
2020 Discrete Applied Mathematics article Engineering Sparse and Compressive Sensing Techniques Open access

10

citations

6 results

References 0