Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptology ePrint Archive, 2016:605, 2016. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Improving NFS for the Discrete Logarithm Problem in Non-prime Finite FieldsRazvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. eurocrypt 2015: 129-155 [doi] Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithmsAurore Guillevic. iacr, 2016:684, 2016. [doi]
The following publications are possibly variants of this publication: