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
Parents
583
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
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 583
1K
13
h-index
9
h-index
7
h-index
7
h-index
6
h-index
1–5 of 1K
470

University of Waterloo
Waterloo, Canada
17 h-index
34 publications
1.8K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
32 publications
1.8K citations
Université de Lorraine
Nancy, France
11 h-index
24 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
12 publications
3.5K citations

National Chung Hsing University
Taichung, Taiwan
10 h-index
17 publications
410 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
24 publications
1.8K citations
University of Missouri–Kansas City
Kansas City, United States
8 h-index
9 publications
312 citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
8 h-index
11 publications
711 citations
1–8 of 470
MCOM · 33 publications · 2.6K citations
21
h-index
20 publications · 609 citations
15
h-index
14 publications · 959 citations
14
h-index
15 publications · 407 citations
12
h-index
12 publications · 2K citations
12
h-index
1–5