The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods

Cécile Pierrot 1
1 ALMASTY - ALgorithms for coMmunicAtion SecuriTY
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this short paper, we propose a variant of the Number Field Sieve to compute discrete logarithms in medium characteristic finite fields. We propose an algorithm that combines two recent ideas, namely the Multiple variant of the Number Field Sieve taking advantage of a large number of number fields in the sieving phase and the Conjugation Method giving a new polynomial selection for the classical Number Field Sieve. The asymptotic complexity of our improved algorithm is L_Q (1/3, (8(9 + 4√6)/15)^(1/3)), where F_Q is the target finite field and (8(9+4√6)/15)^(1/3)) ≈ 2.156. This has to be compared with the complexity of the previous state-of-the-art algorithm for medium characteristic finite fields, the Number Field Sieve with Conjugation Method, that has a complexity of approximately L_Q (1/3, 2.201). Similarly, combining MNFS with the Generalized Joux-Lercier method leads to an improvement on the asymptotic complexities in the boundary case between medium and high characteristic finite fields.
Document type :
Conference papers
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01056205
Contributor : Cécile Pierrot <>
Submitted on : Wednesday, August 20, 2014 - 12:30:29 PM
Last modification on : Thursday, March 21, 2019 - 1:05:58 PM
Long-term archiving on : Thursday, November 27, 2014 - 11:42:20 AM

File

Multiple_Number_Field_Sieve_wi...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NoDerivatives 4.0 International License

Identifiers

Citation

Cécile Pierrot. The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods. Eurocrypt, Apr 2015, Sofia, Bulgaria. pp.156-170, ⟨10.1007/978-3-662-46800-5_7⟩. ⟨hal-01056205v2⟩

Share

Metrics

Record views

295

Files downloads

203