By Topic

On Hardware and Software Implementation of Arithmetic in Finite Fields of Characteristic 7 for Calculation of Pairings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Gashkov, S.B. ; Lomonosov Moscow State Univ., Moscow, ID, USA ; Bolotov, A.A. ; Burtzev, A.A. ; Frolov, A.B.
more authors

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