We study scheme (hardware) and program (software) methods of multiplication of polynomials over fields of characteristic 7 in order to apply them to cryptographic protocols on elliptic curves based on parings. We consider hardware and software implementations of arithmetic in GF(7), GF(72), GF(7n), GF(77n), and GF(714n) and estimate the complexity of corresponding schemes and programs.
Published in:
Dependability of Computer Systems, 2009. DepCos-RELCOMEX '09. Fourth International Conference on
Date of Conference: June 30 2009-July 2 2009