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)

Related topics

Related topics

12 relations
AlgorithmDiscrete logarithmElliptic curve cryptographyHash table

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
BABY-STEP GIANT-STEP ALGORITHM
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… 
2015
2015
BSGS: Bayesian Sparse Group Selection
An R package BSGS is provided for the integration of Bayesian variable and sparse group selection separately proposed by Chen et… 
2013
2013
Modified Baby-Step Giant-Step Algorithm for Discrete Logarithm
A baby-step giant-step algorithm divides  by  blocks that possess ⌈⌉ elements, and subsequently computes and stores  mod… 
2011
2011
Mathematical Approach 2 . 1 Baby-Step Giant-Step Algorithm
The security of cryptosystems depends on the hardness and difficulty of solving the discrete log problem. One of the well known… 
2011
2011
Extending Baby-step Giant-step algorithm for FACTOR problem
Recently, a non-abelian factorization problem together with an associated asymmetric encryption scheme were introduced in [1]. We… 
Review
2008
Review
2008
AN OVERVIEW OF THE INTEGRATED CRATE INTERROGATION SYSTEM (ICIS) FOR USE AT THE SAVANNAH RIVER SITE
The Integrated Crate Interrogation System (ICIS) was developed for use at the Savannah River Site to assay transuranic waste in… 
2005
2005
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special… 
2005
2005
Non Destructive Assay Box Counter
Many long established US DOE facilities are in possession of poorly documented wastes in a variety of forms spanning a broad… 
2004
2004
Analysis of Baby-Step Giant-Step Algorithms for Non-uniform Distributions
The baby-step giant-step algorithm, BSGS for short, was proposed by Shanks in order to compute the class number of an imaginary… 
2000
2000
Baby-Step Giant-Step Algorithms for Non-uniform Distributions
The baby-step giant-step algorithm, due to Shanks, may be used to solve the discrete logarithm problem in arbitrary groups. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)