Efficient multiplications in F55n and F77n

https://doi.org/10.1016/j.cam.2011.06.016Get rights and content
Under an Elsevier user license
open archive

Abstract

Efficient multiplications in finite fields of characteristics 5 and 7 are used for computing the Eta pairing over divisor class groups of the hyperelliptic curves Lee et al. (2008) [1]. In this paper, using the recent methods for multiplication in finite fields, the explicit formulas for multiplication in F55n and F77n are obtained with 10 multiplications in F5n for F55n and 15 multiplications in F7n for F77n improving the results in Cenk and Özbudak (2008) [4], Cenk et al. (2009) [5], Lee et al. (2008) [1] and Montgomery (2005) [12]. The timing results of implementations of the Karatsuba type formulas and the proposed formula for multiplication in F5589 are given.

Highlights

► Efficient multiplications in finite fields are important in applications. ► Characteristics 5 and 7 are used for the Eta pairing. ► We give efficient multiplication formulas for F55n and F77n. ► Timing comparisons are also given.

Keywords

Finite field multiplication
Algebraic function fields
Pairing based cryptography

Cited by (0)