Conference ProceedingsOPEN ACCESS

The solution of McCurley's discrete log challenge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1462 458-471
DOI: 10.1007/BFb0055747
41Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Weber, D., & Denny, T. (1998). The solution of McCurley’s discrete log challenge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1462, pp. 458–471). Springer Verlag. https://doi.org/10.1007/BFb0055747

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free