By Topic

Fully paramaterisable Galois Field arithmetic processor over GF(3m) suitable for elliptic curve cryptography

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
$33 $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

3 Author(s)
T. Kerins ; Dept. of Electr. & Electron. Eng., Univ. Coll. Cork, Ireland ; E. M. Popovici ; W. P. Marnane

In this paper we present an architecture for a flexible GF(3m) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 27n clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different field sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3255). The processor is suitable for cryptographic applications where variable levels of security are required.

Published in:

Microelectronics, 2004. 24th International Conference on  (Volume:2 )

Date of Conference:

16-19 May 2004