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
722
An Unsolvable Problem of Elementary Number Theory
Alonzo Church · American Journal of Mathematics · 1936 · 1.7K citations
On the Power of Quantum Computation
Daniel Simón · SIAM Journal on Computing · 1997 · 1.3K citations
Computing, Computer Science, Physics +14
1–5 of 722
1.4K
12
h-index
11
h-index
11
h-index
9
h-index
8
h-index
1–5 of 1.4K
642

University of Waterloo
Waterloo, Canada
17 h-index
35 publications
3.3K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
32 publications
1.9K citations
University of Missouri–Kansas City
Kansas City, United States
12 h-index
14 publications
778 citations

Macquarie University
Sydney, Australia
10 h-index
10 publications
334 citations
Ruhr University Bochum
Bochum, Germany
10 h-index
17 publications
653 citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
11 publications
3.2K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
9 h-index
19 publications
1.8K citations
Université de Lorraine
Nancy, France
9 h-index
19 publications
1.4K citations
1–8 of 642
MCOM · 28 publications · 2K citations
20
h-index
15 publications · 1.2K citations
15
h-index
15 publications · 611 citations
14
h-index
Repository · 17 publications · 603 citations
14
h-index
16 publications · 423 citations
12
h-index
1–5