Parallelizing pairings on Hessian elliptic curves (Q1713870): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q293716
Created claim: Wikidata QID (P12): Q129654527, #quickstatements; #temporary_batch_1726354825270
 
(5 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Dimitrios Poulakis / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SageMath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ajmsc.2018.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809474924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Pairings at the 192-Bit Security Level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Explicit Formulas for Computing Pairings over Ordinary Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster computation of the Tate pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of pairing-based cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Encryption from the Weil Pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of numbers generated by addition in formal groups and new primality and factorization tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Pairing Computations on Curves with High-Degree Twists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairing Computation on Twisted Edwards Form Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of pairings on Jacobi quartic elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-saving computation of the pairing final exponentiation on BN curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Arithmetic on Hessian Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Pairing Computation on Elliptic Curves in Hessian Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairing Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eta Pairing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Procedure Attack on Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Pairings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Elliptic Curve Model for Faster Pairing Computation / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129654527 / rank
 
Normal rank

Latest revision as of 00:07, 15 September 2024

scientific article
Language Label Description Also known as
English
Parallelizing pairings on Hessian elliptic curves
scientific article

    Statements

    Parallelizing pairings on Hessian elliptic curves (English)
    0 references
    0 references
    30 January 2019
    0 references
    The paper under review deals with the computation of the Ate pairing on the Hessian model of elliptic curves. Explicit addition formulas for the Ate pairing on Hessian curves are given by using a specific representation of points. Using these addition formulas, the efficient computation of the Ate pairing and the parallelization of both the Tate and the Ate pairings on Hessian curves are succeeded. Furthermore, Sage software is provided to ensure the correctness of the obtained formulas. These results extend the results of \textit{H. Gu} et al., [Lect. Notes Comput. Sci. 6829, 169--176 (2011; Zbl 1292.94068)].
    0 references
    Hessian curves
    0 references
    Tate and Ate pairings
    0 references
    parallel computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers