The solution of McCurley's discrete log challenge-Reference-Cited by-同舟云学术

The solution of McCurley's discrete log challenge

Published:1998 Issue: Volume: Page:458-471
ISSN:0302-9743
Container-title:Advances in Cryptology — CRYPTO '98
language:
Short-container-title:

Author:

Weber Damian,Denny Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055747

Reference24 articles.

1. I. Biehl and J. Buchmann and Th. Papanikolaou. LiDIA — a library for computational number theory. Technical report, Universität des Saarlandes/Germany, 1995. http://www.informatik.th-darmstadt.de/TI/LiDIA

2. Th. F, Denny. Lösen grosser dünnbesetzter Gleichungssysteme über endlichen Primkörpern. PhD thesis, Universität des Saarlandes/Germany, 1997.

3. W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. Information Theory 22, pages pp. 472–492, 1976.

4. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Information Theory, 31:469–472, 1985.

5. D. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 6:124–138, 1993.

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography;Arithmetic of Finite Fields;2023

2. An alternative practical public-key cryptosystems based on the Dependent RSA Discrete Logarithm Problems;Expert Systems with Applications;2021-02

3. Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation;Designs, Codes and Cryptography;2020-03-07

4. A Performance Analysis and Evaluation of SIDH with Implementation-Friendly Classes of Quadratic Extension Fields;2019 Seventh International Symposium on Computing and Networking (CANDAR);2019-11

5. Logarithm Based Cryptography;Cybercryptography: Applicable Cryptography for Cyberspace Security;2018-12-05