Remarks on Cheon’s Algorithms for Pairing-Related Problems

DOI10.1007/978-3-540-73489-5_17zbMath1151.94527OpenAlexW1494195543MaRDI QIDQ5429247

Taketeru Kutsuma, Shunji Kozaki, Kazuto Matsuo

Publication date: 29 November 2007

Published in: Pairing-Based Cryptography – Pairing 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73489-5_17

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group ⋮ Optimal generic attack against basic Boneh-Boyen signatures ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem