Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields-Reference-Cited by-同舟云学术

Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields

Published:2015 Issue: Volume: Page:129-155
ISSN:0302-9743
Container-title:Advances in Cryptology -- EUROCRYPT 2015
language:
Short-container-title:

Author:

Barbulescu Razvan,Gaudry Pierrick,Guillevic Aurore,Morain François

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46800-5_6

Reference33 articles.

1. Bai, S., Filbois, A., Gaudry, P., Kruppa, A., Morain, F., Thomé, E., Zimmermann, P., et al.: Crible algébrique: Distribution, optimisation - NFS (2009). downloadable at http://cado-nfs.gforge.inria.fr/

2. Lecture Notes in Computer Science;R Barbulescu,2014

3. Barbulescu, R., Pierrot, C.: The multiple number field sieve for medium- and high-characteristic finite fields. LMS Journal of Computation and Mathematics 17, 230–246 (2014). http://journals.cambridge.org/article_S1461157014000369

4. Barbulescu, R.: Algorithmes de logarithmes discrets dans les corps finis. Ph.D. thesis, Université de Lorraine (2013)

5. Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improvements to the number field sieve for non-prime finite fields. preprint available at http://hal.inria.fr/hal-01052449

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

1. How to Securely and Efficiently Solve the Large-Scale Modular System of Linear Equations on the Cloud;IEEE Transactions on Cloud Computing;2024-07

2. Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation;Journal of Cryptology;2023-12-04

3. Verifiable delay functions and delay encryptions from hyperelliptic curves;Cybersecurity;2023-11-08

4. Individual discrete logarithm with sublattice reduction;Designs, Codes and Cryptography;2023-09-02

5. Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields;IEEE Transactions on Information Theory;2023-06