Efficient Tate pairing computation using double-base chains (Q954437)

From MaRDI portal
Revision as of 09:49, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Efficient Tate pairing computation using double-base chains
scientific article

    Statements

    Efficient Tate pairing computation using double-base chains (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2008
    0 references
    public key cryptography
    0 references
    Tate pairing
    0 references
    elliptic curves
    0 references
    double-base chains
    0 references

    Identifiers