Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing

DOI10.1007/978-3-540-75651-4_4zbMATH Open1391.94783OpenAlexW2148616477MaRDI QIDQ3515102

Tetsuya Izu, Toshiya Nakajima, Tsuyoshi Takagi

Publication date: 25 July 2008

Published in: Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75651-4_4

zbMATH Keywords

finite fieldirreducible polynomialpairingsoftware implementationcharacteristic threereduction optimal trinomial

Mathematics Subject Classification ID

Cryptography (94A60) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515102)