Refined analysis to the extended tower number field sieve

DOI10.1016/j.tcs.2020.01.010zbMath1472.11323OpenAlexW3002042021WikidataQ126320867 ScholiaQ126320867MaRDI QIDQ2304549

Chang Lv, Jincheng Zhuang, Jiejing Wen, Yuqing Zhu, Dong-Dai Lin

Publication date: 12 March 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.01.010

zbMATH Keywords

discrete logarithm problemcomplexity analysisdescent phaseextended tower number field sievesmoothing phase

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• A one round protocol for tripartite Diffie-Hellman
• Function field sieve method for discrete logarithms over finite fields
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Special prime numbers and discrete logs in finite prime fields
• The Tower Number Field Sieve
• Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
• New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• The multiple number field sieve for medium- and high-characteristic finite fields
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
• An LLL Algorithm with Quadratic Complexity
• The Function Field Sieve in the Medium Prime Case
• Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
• Solving sparse linear equations over finite fields
• New directions in cryptography
• Discrete logarithms and local units
• On the discrete logarithm problem in finite fields of fixed characteristic
• Faster individual discrete logarithms in finite fields of composite extension degree
• Identity-Based Encryption from the Weil Pairing
• Using number fields to compute logarithms in finite fields
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Advances in Cryptology - CRYPTO 2003
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The Number Field Sieve in the Medium Prime Case
• Public Key Cryptography - PKC 2006

This page was built for publication: Refined analysis to the extended tower number field sieve