Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Xin-Xin Fan / rank
Normal rank
 
Property / author
 
Property / author: Xin-Xin Fan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIRACL / 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.1007/978-3-642-04159-4_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1529567625 / 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 pairing computation on supersingular abelian varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409129 / 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: Q4474196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Cryptology - ICISC 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinary Abelian varieties having small embedding degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / 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: Ate Pairing on Hyperelliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairing Calculation on Supersingular Genus 2 Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eta Pairing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulae for arithmetic on genus 2 hyperelliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:20, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
scientific article

    Statements

    Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (English)
    0 references
    0 references
    0 references
    0 references
    3 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    genus-2 hyperelliptic curves
    0 references
    Tate pairing
    0 references
    Miller's algorithm
    0 references
    projective coordinates
    0 references
    efficient implementation
    0 references
    0 references