Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931)

From MaRDI portal
Revision as of 23:36, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
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
    28 March 2013
    0 references
    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