Simplified pairing computation and security implications

DOI10.1515/JMC.2007.013MaRDI QIDQ5443538zbMATH OpenWikidataFDO

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

Publication date 21 February 2008

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

Full work available at URL https://doi.org/10.1515/JMC.2007.013

zbMATH Keywords

cryptographyelliptic supersingular curvespairing

Mathematics Subject Classification ID

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

Recommendations

• Pairing inversion via non-degenerate auxiliary pairings
• On Pairing Inversion Problems
• The realm of the pairings
• Pairing-based cryptography and its security analysis
• Pairing-based cryptography and its security analysis

Cites work

• A Fault Attack on Pairing-Based Cryptography
• 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
• Efficient pairing computation on supersingular abelian varieties
• The Eta Pairing Revisited
• The Magma algebra system. I: The user language
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

Cited in

(13)

• Polynomial approximation of bilinear Diffie-Hellman maps
• Pairing inversion for finding discrete logarithms
• An attack on disguised elliptic curves
• Pairings in Trusted Computing
• Aspects of Pairing Inversion
• Exponentiation inversion problem reduced from fixed argument pairing inversion on twistable ate pairing and its difficulty
• On Pairing Inversion Problems
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• Pairing inversion via non-degenerate auxiliary pairings
• Secure and Efficient Pairing at 256-Bit Security Level
• The Diffie-Hellman problem and generalization of Verheul's theorem
• On computable isomorphisms in efficient asymmetric pairing-based systems
• Closed formulae for the Weil pairing inversion

Describes a project that uses

Uses Software

• Magma

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

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