The Baby-Step Giant-Step Algorithm is a deterministic algorithm in computational number theory that solves the discrete logarithm problem in a finite cyclic group by balancing time and space complexity through a meet-in-the-middle technique, distinguishing it from exhaustive search and index calculus methods.
9
Publications
546
Citations
12
Authors
7
Institutions
Publications per year
2017–2026
1
Variants
Baby-step Giant-stepBsgs
Parents
Publications
9
A modification of Shanks’ baby-step giant-step algorithm
David C. Terr · Mathematics of Computation · 1999 · 23 citations · Full text
Daniel Bernstein, Tanja Lange · The Open Book Series · 2013 · 19 citations · Full text
1–5 of 9
Authors
12
- RA
2
h-index
- TL
1
h-index
- BS
1
h-index
- AE
1
h-index
- AJ
1
h-index
1–5 of 12
Institutions
7
Beirut Arab University
Beirut, Lebanon
2 h-index
2 publications
22 citations
Lebanese American University
Beirut, Lebanon
2 h-index
3 publications
33 citations
University of Waterloo
Waterloo, Canada
1 h-index
1 publications
66 citations
North Carolina State University
Raleigh, United States
1 h-index
1 publications
16 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
1 h-index
1 publications
19 citations
University of Salzburg
Salzburg, Austria
1 h-index
1 publications
21 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
19 citations
Sun Yat-sen University
Guangzhou, China
1 publications
13 citations
1–8 of 7
Venues
- Mathematics of Computation
MCOM · 4 publications · 125 citations
4
h-index
- Journal de Théorie des Nombres de Bordeaux
JTNB · 1 publications · 364 citations
1
h-index
- The Open Book Series
1 publications · 19 citations
1
h-index
- rita_
1 publications · 11 citations
1
h-index
- Advances in Mathematics of Communications
1 publications · 13 citations
1–5