Faster explicit formulae for computing pairings via elliptic nets and their parallel computation (Q1800687)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
scientific article

    Statements

    Faster explicit formulae for computing pairings via elliptic nets and their parallel computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    optimal pairing
    0 references
    symmetric pairing
    0 references
    Tate pairing
    0 references
    elliptic net
    0 references
    parallel computation
    0 references
    0 references