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 structure. More precisely, we focus on discrete logarithms equal to products in groups of unknown order. As an example of application, we show that this new algorithm enables to cryptanalyse a variant of the GPS scheme proposed by Girault and Lefranc at CHES 2004 conference in which the private key is equal to the product of two sub-private keys of low Hamming weight. We also describe a second attack based on a known variant of the Baby-Step Giant-Step algorithm using the low Hamming weight of the sub-private keys. Key words: Baby-Step Giant-Step algorithm, discrete logarithm, GPS scheme, binary trees, low Hamming weight.

• Type: Conference
• Year: 2005
• Where: CHES
• Authors: Jean-Sébastien Coron, David Lefranc, Guillaume Poupard
• Keywords: Baby-Step Giant-Step Algorithm, CHES 2005, Cryptography, Discrete Logarithm, Low Hamming Weight