Explicit formulas for efficient multiplication in F_{3^{6m}}

Simple item page
dc.creatorGorla, Elisa
dc.creatorPuttmann, Christoph
dc.creatorShokrollahi, Jamshid
dc.date2007-08-22
dc.date.accessioned2026-07-07T08:24:58Z
dc.date.available2026-07-07T08:24:58Z
dc.descriptionEfficient computation of the Tate pairing is an important part of pairing-based cryptography. Recently with the introduction of the Duursma-Lee method special attention has been given to the fields of characteristic 3. Especially multiplication in F_{3^{6m}}, where m is prime, is an important operation in the above method. In this paper we propose a new method to reduce the number of F_{3^m} multiplications for multiplication in F_{3^{6m}} from 18 in recent implementations to 15. The method is based on the fast Fourier tranmsform and explicit formulas are given. The execution times of our software implementations for F_{3^{6m}} show the efficiency of our results.
dc.description11 pages, to appear in the proceedings of SAC2007
dc.identifierhttps://arxiv.org/abs/0708.3014
dc.identifierhttp://arxiv.org/abs/0708.3014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136521
dc.subjectCryptography and Security
dc.subjectComputational Complexity
dc.titleExplicit formulas for efficient multiplication in F_{3^{6m}}
dc.typetext

Files

Collections

arXiv