Parallelizing pairings on Hessian elliptic curves

DOI10.1016/J.AJMSC.2018.06.001MaRDI QIDQ1713870zbMATH OpenOpenAlexWikidataFDO

Authors Emmanuel Fouotsa

Publication date 30 January 2019

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

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

Recommendations

• Noncrossing partitions and Bruhat order
• Noncrossing partitions, Bruhat order and the cluster complex
• Noncrossing partitions and the shard intersection order
• Noncrossing partitions and the shard intersection order
• Non-crossing partition lattices in finite real reflection groups

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 1882020 (Why is no real title available?)
• scientific article; zbMATH DE number 1878345 (Why is no real title available?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Another elliptic curve model for faster pairing computation
• Efficient arithmetic on Hessian curves
• Efficient computation of pairings on Jacobi quartic elliptic curves
• Efficient implementation of pairing-based cryptosystems
• Efficient pairing computation on elliptic curves in Hessian form
• Exceptional Procedure Attack on Elliptic Curve Cryptosystems
• Faster computation of the Tate pairing
• Faster explicit formulas for computing pairings over ordinary curves
• Faster pairing computations on curves with high-degree twists
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Identity-Based Encryption from the Weil Pairing
• Implementing pairings at the 192-bit security level
• Memory-saving computation of the pairing final exponentiation on BN curves
• Optimal Pairings
• Pairing Computation on Twisted Edwards Form Elliptic Curves
• Pairing Lattices
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• The Eta Pairing Revisited
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems

Cited in

(13)

• Efficient pairing computation on elliptic curves in Hessian form
• Noncrossing partitions and the shard intersection order
• Tate pairing computation on generalized Hessian curves
• Noncrossing partitions, Bruhat order and the cluster complex
• Heuristics on pairing-friendly elliptic curves
• On Software Parallel Implementation of Cryptographic Pairings
• Complete addition formulas on the level four theta model of elliptic curves
• Isogenies on twisted Hessian curves
• Division polynomials on the Hessian model of elliptic curves
• On maximal chains in the non-crossing partition lattice
• Elliptic divisibility sequences over the Edwards model of elliptic curves
• Noncrossing partitions and Bruhat order
• A new attack on RSA and Demytko's elliptic curve cryptosystem

Describes a project that uses

Uses Software

• SageMath

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

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