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

DOI10.1007/978-3-642-34961-4_5zbMATH Open1292.94073OpenAlexW119990972MaRDI QIDQ4911577FDOQ4911577

Authors: Takuya Hayashi, Takeshi Shimoyama, 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

Recommendations

• Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
• Cryptanalysis of pairing-based cryptosystems over small characteristic fields
• On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem
• Selected Areas in Cryptography
• Side channel attacks against pairing over theta functions
• Breaking a class of public-key cryptosystems with Euclid's algorithm
• On finite fields for pairing based cryptography
• Cryptanalysis of the \(MST_{3}\) public key cryptosystem
• Séta: Supersingular Encryption from Torsion Attacks

zbMATH Keywords

pairing-based cryptosystemsdiscrete logarithm problemsfunction field sieve\(\eta_T\) pairing

Mathematics Subject Classification ID

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

Cited In (12)

• Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
• Effective compression maps for torus-based cryptography
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
• Updating key size estimations for pairings
• On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
• Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)
• Heuristics of the Cocks-Pinch method
• Selecting polynomials for the function field sieve
• Cryptanalysis of pairing-based cryptosystems over small characteristic fields
• Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Indiscreet logarithms in finite fields of small characteristic

This page was built for publication: Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)

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