The solution of McCurley's discrete log challenge

  • Damian Weber
  • Thomas Denny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1462)

Abstract

We provide the secret Diffie-Hellman-Key which is requested by Kevin McCurley's challenge of 1989. The DH-protocol in question has been carried out in (ℤ/pℤ) where p is a 129-digit prime of special form. Our method employed the Number Field Sieve. The linear algebra computation was done by the Lanczos algorithm.

Keywords

Discrete Logarithms Number Field Sieve Index Calculus Lanczos 

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Damian Weber
    • 1
  • Thomas Denny
    • 2
  1. 1.Institut für Techno- und WirtschaftsmathematikKaiserslautern
  2. 2.Debis IT Security ServicesBonn

Personalised recommendations