Baby-step giant-step
id:
baby-step-giant-step-179-14997333
title:
Baby-step giant-step
text:
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. The discrete log problem is of fundamental importance to the area of public key cryptography. Many of the most commonly used cryptography systems are based on the assumption that the discrete log is extremely difficult to compute; the more difficult it is, the more security it provides a data t
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for solving the discrete logarithm problem
original url:
https://en.wikipedia.org/wiki/Baby-step_giant-step
date created:
2004-03-30T07:01:45Z
date modified:
2024-09-05T09:25:53Z
main entity:
{"identifier":"Q797983","url":"https://www.wikidata.org/entity/Q797983"}
image:
fields total:
13
integrity:
15