The solution of McCurley's discrete log challenge

We provide the secret Diffie-Hellman-Key which is requested by Kevin Mc-Curley's challenge of 1989. The DH-protocol in question has been carried out in (ZZ/pZZ) * 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.