FPM 2009, vol. 15, no. 3, pp. 75-111

FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2009, VOLUME 15, NUMBER 3, PAGES 75-111

On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings

S. B. Gashkov
A. A. Bolotov
A. A. Burtsev
S. Yu. Zhebet
A. B. Frolov

Abstract

View as HTML View as gif image

We study scheme (hardware) and program (software) methods of multiplication of polynomials over fields of characteristic $7$ in order to apply them to parings based cryptographic protocols on hyperelliptic curves of genus three. We consider hardware and software implementations of arithmetic in $GF(7)$ , $GF(7$ ²), $GF(7$ ⁿ), $GF(7$ ⁷ⁿ), and $GF(7$ ¹⁴ⁿ) and estimate the complexity of corresponding schemes and programs.

Main page

Contents of the journal

News

Location: http://mech.math.msu.su/~fpm/eng/k09/k093/k09307h.htm
Last modified: January 13, 2010