Solving a 676-Bit Discrete Logarithm Problem in GF(36n )

DOI10.1007/978-3-642-13013-7_21zbMath1281.94028OpenAlexW1513733176MaRDI QIDQ3562907

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

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

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

Related Items (3)

Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Selecting polynomials for the Function Field Sieve

This page was built for publication: Solving a 676-Bit Discrete Logarithm Problem in GF(36n )