Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931): 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: Chun-Ming Tang / rank
Normal rank
 
Property / author
 
Property / author: Mao-Zhi Xu / rank
Normal rank
 
Property / author
 
Property / author: Chun-Ming Tang / rank
 
Normal rank
Property / author
 
Property / author: Mao-Zhi Xu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / 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.ipl.2011.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047092919 / 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: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in the Jacobian of a Hyperelliptic Curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Identity-Based Signature from Gap Diffie-Hellman Groups / 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: Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates / 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: Hyperelliptic Pairings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ate Pairing on Hyperelliptic Curves / 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: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperelliptic cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Generalized Pairing Computation on Abelian Varieties / 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: The Weil pairing, and its efficient calculation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-based authenticated key agreement protocol based on Weil pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Pairings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Faster pairing computation on genus \(2\) hyperelliptic curves
scientific article

    Statements

    Faster pairing computation on genus \(2\) hyperelliptic curves (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    cryptography
    0 references
    genus-\(2\) hyperelliptic curves
    0 references
    pairing-based cryptography
    0 references
    efficiently computable endomorphisms
    0 references
    pairing computation
    0 references

    Identifiers