On computable isomorphisms in efficient asymmetric pairing-based systems (Q869575)

From MaRDI portal
Revision as of 15:37, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On computable isomorphisms in efficient asymmetric pairing-based systems
scientific article

    Statements

    On computable isomorphisms in efficient asymmetric pairing-based systems (English)
    0 references
    0 references
    0 references
    8 March 2007
    0 references
    0 references
    pairing-based cryptography
    0 references
    Tate pairing
    0 references
    elliptic curve
    0 references
    0 references