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

DOI10.1007/978-3-319-44524-3_19zbMath1398.94149OpenAlexW2514372180MaRDI QIDQ1800687

Shigenori Uchiyama, Tadanori Teruya, Hiroshi Onuki, Naoki Kanayama

Publication date: 24 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-44524-3_19

zbMATH Keywords

parallel computationTate pairingoptimal pairingelliptic netsymmetric pairing

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

This page was built for publication: Faster explicit formulae for computing pairings via elliptic nets and their parallel computation