Skip to search formSkip to main contentSkip to account menu

Baby-step giant-step

Known as: BSGS, Baby step giant step 
In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm. The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
I describe a modification to Shanks' baby-step giant-step algo- rithm for computing the order n of an element g of a group G… 
2013
2013
A baby-step giant-step algorithm divides  by  blocks that possess ⌈⌉ elements, and subsequently computes and stores  mod… 
2011
2011
Recently, a non-abelian factorization problem together with an associated asymmetric encryption scheme were introduced in [1]. We… 
2011
2011
The security of cryptosystems depends on the hardness and difficulty of solving the discrete log problem. One of the well known… 
Review
2008
Review
2008
The Integrated Crate Interrogation System (ICIS) was developed for use at the Savannah River Site to assay transuranic waste in… 
2005
2005
2005
Many long established US DOE facilities are in possession of poorly documented wastes in a variety of forms spanning a broad… 
2004
2004
The baby-step giant-step algorithm, BSGS for short, was proposed by Shanks in order to compute the class number of an imaginary… 
2002
2002
Three different Bulk Specialty Gas delivery Systems (BSGS) were designed and tested up to flow rates of 1000 slpm. Conventional… 
2000
2000
The baby-step giant-step algorithm, due to Shanks, may be used to solve the discrete logarithm problem in arbitrary groups. The…