Lattice Reduction

Lattice Reduction is an algorithmic procedure in computational number theory and cryptography that belongs to the class of lattice basis improvement methods, distinguished by its aim to transform a given basis of a lattice into an equivalent basis comprising shorter, nearly orthogonal vectors, thereby facilitating the solution of hard lattice problems such as the shortest vector problem (SVP) and closest vector problem (CVP).

486

Publications

36.2K

Citations

972

Authors

448

Institutions

Publications per year

2017–2026

75

Authors

972

  1. DS
    Damien Stehlé

    École Normale Supérieure de Lyon, France

    15 publications · 1.2K citations

    14

    h-index

  2. CL
    Cong Ling

    Imperial College London, United Kingdom

    17 publications · 867 citations

    13

    h-index

  3. XM
    Xiaoli Ma

    Georgia Institute of Technology, United States

    17 publications · 618 citations

    12

    h-index

  4. OR
    Oded Regev

    Tel Aviv University, Israel

    12 publications · 6.4K citations

    11

    h-index

  5. RF
    Robert F. H. Fischer

    Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany

    9 publications · 508 citations

    10

    h-index

1–5 of 972

Venues

  1. IEEE Transactions on Information Theory

    14 publications · 1K citations

    14

    h-index

  2. IEEE Transactions on Wireless Communications

    14 publications · 419 citations

    12

    h-index

  3. IEEE Transactions on Signal Processing

    13 publications · 765 citations

    11

    h-index

  4. IEEE Transactions on Communications

    10 publications · 506 citations

    10

    h-index

  5. SIAM Journal on Computing

    8 publications · 1.6K citations

    8

    h-index

1–5