Solving a 676-bit discrete logarithm problem in GF(3⁶ⁿ)

DOI10.1007/978-3-642-13013-7_21MaRDI QIDQ3562907zbMATH OpenOpenAlexFDO

Authors Takuya Hayashi, Naoyuki Shinohara, Li-hua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_21

zbMATH Keywords

discrete logarithm problempairing-based cryptosystemsfunction field sieve

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Cryptanalysis of pairing-based cryptosystems over small characteristic fields
• Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$

Cited in

(4)

• Solving a $$6120$$ -bit DLP on a Desktop Computer
• Updating key size estimations for pairings
• Selecting polynomials for the function field sieve
• Indiscreet logarithms in finite fields of small characteristic

This page was built for publication: Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562907)