Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)

DOI10.1007/978-3-642-34961-4_5zbMath1292.94073OpenAlexW119990972MaRDI QIDQ4911577

Takeshi Shimoyama, Takuya Hayashi, Naoyuki Shinohara, Tsuyoshi Takagi

Publication date: 19 March 2013

Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_5

zbMATH Keywords

discrete logarithm problemspairing-based cryptosystemsfunction field sieve\(\eta_T\) pairing

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (8)

Effective compression maps for torus-based cryptography ⋮ Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Heuristics of the Cocks-Pinch method ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ 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: Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)