bn:03370745n
Noun Concept
Categories: Number theoretic algorithms, Group theory
EN
baby-step giant-step  Baby-step giant-step method  Baby step giant step
EN
In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks. Wikipedia
Definitions
Relations
Sources
EN
In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks. Wikipedia
An algorithm for solving the discrete logarithm problem Wikipedia Disambiguation