Ring Learning With Errors Problem

The Ring Learning with Errors Problem is a computational hardness assumption in lattice-based cryptography that belongs to the class of learning problems with noise, distinguished by its reliance on polynomial ring structures over finite fields to enhance efficiency and security in cryptographic constructions.

41

Publications

2.7K

Citations

122

Authors

68

Institutions

Publications per year

2017–2026

26

Variants

Ring Lwe Problem

Authors

122

  1. PH
    Pengzhou He

    Villanova University, United States

    3 publications · 90 citations

    3

    h-index

  2. JX
    Jiafeng Xie

    Villanova University, United States

    3 publications · 90 citations

    3

    h-index

  3. KE
    Katherine E. Stange

    Stanford University, United States

    3 publications · 67 citations

    3

    h-index

  4. VV
    Vinod Vaikuntanathan

    Massachusetts Institute of Technology, United States

    3 publications · 177 citations

    3

    h-index

  5. KL
    Kristin Lauter

    Microsoft (United States), United States

    3 publications · 67 citations

    3

    h-index

1–5 of 122

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 4 publications · 253 citations

    4

    h-index

  2. 3

    h-index

  3. 2

    h-index

  4. 2

    h-index

  5. Journal of Cryptology

    2 publications · 47 citations

    2

    h-index

1–5