Discrete Logarithm Algorithms

Discrete Logarithm Algorithms is a class of computational methods in number-theoretic algorithms designed to solve the discrete logarithm problem by determining the exponent in a modular arithmetic equation, distinguishing it from other cryptographic or algebraic techniques through its focus on finite cyclic groups and their logarithmic complexity.

583

Publications

52.9K

Citations

1K

Authors

470

Institutions

Publications per year

2017–2026

62

Authors

1K

  1. PG
    Pierrick Gaudry

    Centre National de la Recherche Scientifique, France

    16 publications · 1K citations

    13

    h-index

  2. ET
    Emmanuel Thomé

    Centre Inria de l'Université de Lorraine, France

    9 publications · 580 citations

    9

    h-index

  3. MH
    Min‐Shiang Hwang

    National Chung Hsing University, Taiwan

    7 publications · 191 citations

    7

    h-index

  4. LH
    Lein Harn

    University of Missouri–Kansas City, United States

    7 publications · 258 citations

    7

    h-index

  5. FZ
    Fangguo Zhang

    Sun Yat-sen University, China

    6 publications · 152 citations

    6

    h-index

1–5 of 1K

Venues

  1. Mathematics of Computation

    MCOM · 33 publications · 2.6K citations

    21

    h-index

  2. Electronics Letters

    20 publications · 609 citations

    15

    h-index

  3. Journal of Cryptology

    14 publications · 959 citations

    14

    h-index

  4. Information Processing Letters

    15 publications · 407 citations

    12

    h-index

  5. IEEE Transactions on Information Theory

    12 publications · 2K citations

    12

    h-index

1–5