An Efficient Residue Group Multiplication for the η T Pairing over ${\mathbb F}_{3^m}$
From MaRDI portal
Publication:3651271
DOI10.1007/978-3-642-05445-7_23zbMath1267.94094OpenAlexW1909094254MaRDI QIDQ3651271
Yuta Sasaki, Tsuyoshi Takagi, Satsuki Nishina, Masaaki Shirase
Publication date: 9 December 2009
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-05445-7_23
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
This page was built for publication: An Efficient Residue Group Multiplication for the η T Pairing over ${\mathbb F}_{3^m}$