Simplified pairing computation and security implications

DOI10.1515/JMC.2007.013zbMath1145.11047WikidataQ61914063 ScholiaQ61914063MaRDI QIDQ5443538

Steven D. Galbraith, Colm Ó Héigeartaigh, Caroline Sheedy

Publication date: 21 February 2008

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

zbMATH Keywords

cryptographypairingelliptic supersingular curves

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Polynomial approximation of bilinear Diffie-Hellman maps ⋮ Closed formulae for the Weil pairing inversion ⋮ The Diffie-Hellman problem and generalization of Verheul's theorem

Uses Software

• Magma

Cites Work

• The Magma algebra system. I: The user language
• Efficient pairing computation on supersingular abelian varieties
• A Fault Attack on Pairing-Based Cryptography
• The Eta Pairing Revisited
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Ate Pairing on Hyperelliptic Curves
• Comparison Between XL and Gröbner Basis Algorithms

This page was built for publication: Simplified pairing computation and security implications