Parallelizing pairings on Hessian elliptic curves

DOI10.1016/j.ajmsc.2018.06.001zbMath1405.14080OpenAlexW2809474924WikidataQ129654527 ScholiaQ129654527MaRDI QIDQ1713870

Emmanuel Fouotsa

Publication date: 30 January 2019

Published in: Arab Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ajmsc.2018.06.001

zbMATH Keywords

parallel computationHessian curvesTate and Ate pairings

Mathematics Subject Classification ID

Elliptic curves (14H52) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Elliptic divisibility sequences over the Edwards model of elliptic curves ⋮ Division polynomials on the Hessian model of elliptic curves ⋮ Isogenies on twisted Hessian curves ⋮ Complete addition formulas on the level four theta model of elliptic curves ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Memory-saving computation of the pairing final exponentiation on BN curves
• Efficient computation of pairings on Jacobi quartic elliptic curves
• Efficient implementation of pairing-based cryptosystems
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Faster computation of the Tate pairing
• Another Elliptic Curve Model for Faster Pairing Computation
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Efficient Pairing Computation on Elliptic Curves in Hessian Form
• The Eta Pairing Revisited
• Faster Pairing Computations on Curves with High-Degree Twists
• Efficient Arithmetic on Hessian Curves
• Pairing Lattices
• Pairing Computation on Twisted Edwards Form Elliptic Curves
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Exceptional Procedure Attack on Elliptic Curve Cryptosystems
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Identity-Based Encryption from the Weil Pairing
• Implementing Pairings at the 192-Bit Security Level
• Optimal Pairings
• Handbook of Elliptic and Hyperelliptic Curve Cryptography

This page was built for publication: Parallelizing pairings on Hessian elliptic curves