Discrete Logarithm Problem

The Discrete Logarithm Problem is a computational problem in number theory and cryptography that consists of determining the unique integer \( k \) such that \( g^k \equiv h \pmod{p} \), given a prime \( p \), a generator \( g \) of the multiplicative group modulo \( p \), and an element \( h \) in that group, distinguishing it from related algebraic problems by its reliance on the difficulty of inverting exponentiation in finite cyclic groups.

722

Publications

49.5K

Citations

1.4K

Authors

642

Institutions

Publications per year

2017–2026

158

Authors

1.4K

  1. PG
    Pierrick Gaudry

    Centre National de la Recherche Scientifique, France

    14 publications · 993 citations

    12

    h-index

  2. LH
    Lein Harn

    University of Missouri–Kansas City, United States

    12 publications · 724 citations

    11

    h-index

  3. CM
    Chandrashekhar Meshram

    Raja Shankar Shah University

    11 publications · 201 citations

    11

    h-index

  4. IE
    Igor E. Shparlinski

    Macquarie University, Australia

    9 publications · 280 citations

    9

    h-index

  5. YT
    Yuh‐Min Tseng

    National Changhua University of Education, Taiwan

    8 publications · 178 citations

    8

    h-index

1–5 of 1.4K

Venues

  1. Mathematics of Computation

    MCOM · 28 publications · 2K citations

    20

    h-index

  2. Journal of Cryptology

    15 publications · 1.2K citations

    15

    h-index

  3. IEEE Access

    15 publications · 611 citations

    14

    h-index

  4. IACR Cryptology ePrint Archive

    Repository · 17 publications · 603 citations

    14

    h-index

  5. Electronics Letters

    16 publications · 423 citations

    12

    h-index

1–5