Lattice-based Cryptography

Lattice-Based Cryptography is a branch of public-key cryptography that constructs cryptographic primitives based on the computational hardness of lattice problems, such as the shortest vector problem or the closest vector problem, distinguishing it from other branches by its reliance on the algebraic and geometric structure of integer lattices.

780

Publications

49K

Citations

1.7K

Authors

659

Institutions

Publications per year

2017–2026

464

Authors

1.7K

  1. TG
    Tim Güneysu

    Ruhr University Bochum, Germany

    16 publications · 657 citations

    16

    h-index

  2. CP
    Chris Peikert

    Georgia Institute of Technology, United States

    18 publications · 3.5K citations

    16

    h-index

  3. AK
    Ayesha Khalid

    Queen's University Belfast, United Kingdom

    17 publications · 605 citations

    14

    h-index

  4. YH
    Yupu Hu

    Xidian University, China

    14 publications · 300 citations

    13

    h-index

  5. XW
    Xingyuan Wang

    Dalian University of Technology, China

    14 publications · 1.5K citations

    13

    h-index

1–5 of 1.7K

Venues

  1. 23

    h-index

  2. IEEE Access

    41 publications · 1.5K citations

    22

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 50 publications · 1.8K citations

    20

    h-index

  4. IEEE Transactions on Computers

    18 publications · 855 citations

    17

    h-index

  5. Security and Communication Networks

    17 publications · 383 citations

    13

    h-index

1–5