Parallelizing pairings on Hessian elliptic curves

DOI10.1016/J.AJMSC.2018.06.001zbMATH Open1405.14080OpenAlexW2809474924WikidataQ129654527 ScholiaQ129654527MaRDI QIDQ1713870FDOQ1713870

Authors: 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

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

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)

Cites Work

• Faster explicit formulas for computing pairings over ordinary curves
• Identity-Based Encryption from the Weil Pairing
• Title not available (Why is that?)
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Faster computation of the Tate pairing
• Title not available (Why is that?)
• Memory-saving computation of the pairing final exponentiation on BN curves
• Another elliptic curve model for faster pairing computation
• The Eta Pairing Revisited
• Faster pairing computations on curves with high-degree twists
• Efficient arithmetic on Hessian curves
• Pairing Lattices
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Implementing pairings at the 192-bit security level
• Optimal Pairings
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Pairing Computation on Twisted Edwards Form Elliptic Curves
• Title not available (Why is that?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Efficient pairing computation on elliptic curves in Hessian form
• Efficient computation of pairings on Jacobi quartic elliptic curves
• Title not available (Why is that?)
• Exceptional Procedure Attack on Elliptic Curve Cryptosystems
• Efficient implementation of pairing-based 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
• Elliptic divisibility sequences over the Edwards model of elliptic curves
• On maximal chains in the non-crossing partition lattice
• A new attack on RSA and Demytko's elliptic curve cryptosystem
• Noncrossing partitions and Bruhat order

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)