baby-step giant-step algorithm

E2186155 UNEXPLORED

The baby-step giant-step algorithm is a time–memory trade-off method for solving discrete logarithm problems in finite groups, running in roughly square-root time and widely used in algorithmic number theory and cryptography.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
baby-step giant-step algorithm canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

algorithmic number theory → notableAlgorithm → baby-step giant-step algorithm ⓘ