A new baby-step giant-step algorithm and some applications to cryptanalysis

Lecture Notes in Computer Science

Volumn 3659, Issue , 2005, Pages 47-60

  Coron, Jean Sébastien ^a   Lefranc, David ^b   Poupard, Guillaume ^c  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b ORANGE LABS   (France)

^c DCSSI Crypto Laboratory   (France)

Author keywords

Baby Step Giant Step algorithm; Binary trees; Discrete logarithm; GPS scheme; Low Hamming weight

Indexed keywords

ALGORITHMS; EMBEDDED SYSTEMS; GLOBAL POSITIONING SYSTEM;

BABY-STEP GIANT-STEP ALGORITHMS; BINARY TREES; DISCRETE LOGARITHMS; GPS SCHEMES; LOW HAMMING WEIGHTS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 27244439848     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11545262_4     Document Type: Conference Paper

References (18)

1. H. Cohen. A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics. Springer-Verlag, 1993.
2. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6):644-654, November 1976.
3. A. Fiat and A. Shamir. How to Prove Yourself : Practical Solutions to Identification and Signature Problems. In A. M. Odlyzko, editor, Advances in Cryptology - Crypto'86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer Verlag, 1986.
4. M. Girault. Self-Certified Public Keys. In D. W. Davies, editor, Advances in Cryptology - Eurocrypt'91, volume 547 of Lecture Notes in Computer Science, pages 490-497. Springer-Verlag, 1991.
5. M. Girault and D. Lefranc. Public Key Authentication with one Single (on-line) Addition. In M. Joye and J. J. Quisquater, editors, CHES, volume 3156 of Lecture Notes in Computer Science, pages 413-427. Springer-Verlag, 2004.
6. L. C. Guillou and J. J. Quisquater. A Practical Zero-knowledge Protocol Fitted to Security Microprocessor Minimizing both Transmission and Memory. In C. G. Günther, editor, Advances in Cryptology - Eurocrypt'88, volume 330 of Lecture Notes in Computer Science, pages 123-128. Springer-Verlag, 1988.
7. J. Hoffstein and J.H. Silverman. Random Small Hamming Weight Products with Applications to Cryptography. Technical report, NTRU Cryptosystems.
8. National Institute of Standards and Technologies. Digital Signature Standard (DSS). Federal Information Processing Standards, Publication 186, november 1994.
9. A. M. Odlyzko. Discrete Logarithms: The Past and The Future. Designs, Codes, and Cryptography, 19(2/3):129-145, 2000.
10. T. Okamoto, H. Katsuno, and E. Okamoto. A Fast Signature Scheme based on new on-line Computation. In C. Boyd and W. Mao, editors, Information Security Conference'02, number 2851 in Lecture Notes in Computer Science, pages 111-121. Springer-Verlag, 2003.
11. T. Okamoto, M. Tada, and A. Miyaji. An Improved Fast Signature Scheme without on-line Multiplication. In M. Blaze, editor, Financial Crypto, volume 2357 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
12. J. M. Pollard. Monte Carlo Methods for Index Computations (mod p). Mathematics of Computation, 32(143):918-924, 1978.
13. G. Poupard and J. Stern. Security Analysis of a Practical "on the fly" Authentication and Signature Generation. In K. Nyberg, editor, Advances in Cryptology - Eurocrypt'98, volume 1403 of Lecture Notes in Computer Science, pages 422-436. Springer-Verlag, 1998.
14. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communication of the ACM, 21(2):120-126, 1978.
15. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In G. Brassard, editor, Advances in Cryptology - Crypto'89, volume 435 of Lecture Notes in Computer Science, pages 239-252. Springer-Verlag, 1990.
16. V. Shoup. Practical Threshold Signatures. In B. Preneel, editor, Advances in Cryptology - Eurocrypt'00, volume 1807 of Lecture Notes in Computer Science, pages 207-220. Springer-Verlag, 2000.
17. J. Stern and J. P. Stern. Cryptanalysis of the OTM Signature Scheme from FC'02. In R. N. Wright, editor, Financial Cryptography'03, volume 2742 of Lecture Notes in Computer Science, pages 138-148. Springer-Verlag, 2003.
18. D. R. Stinson. Some Baby-Step Giant-Step Algorithms for the Low Hamming Weight Discrete Logarithm Problem. Mathematics of Computation, 71(237):379-391, 2002.