On the Final Exponentiation in Tate Pairing Computations

DOI10.1109/TIT.2013.2240763MaRDI QIDQ2989229zbMATH OpenFDO

Authors Taechan Kim, Sungwook Kim, Jung Hee Cheon

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited in

(6)

• Identity-based undetachable digital signature for mobile agents in electronic commerce
• scientific article; zbMATH DE number 7746256 (Why is no real title available?)
• Curves with Fast Computations in the First Pairing Group
• CRT-based outsourcing algorithms for modular exponentiations
• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
• Scalable zero knowledge via cycles of elliptic curves

This page was built for publication: On the Final Exponentiation in Tate Pairing Computations

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