By Topic

Two hardware implementations of the group operations necessary for implementing an elliptic curve cryptosystem over a characteristic two finite field

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

2 Author(s)
Potgieter, M.J. ; Pretoria Univ., South Africa ; van Dyk, B.J.

Two FPGA (field-programmable gate array) implementations of the elliptic curve scalar multiplication operation are presented. The main design objective influencing all implementation decisions was complete scalability. Scalability refers to being able to change both the field size and the elliptic curve parameters without reprogramming the hardware. Measures were taken during the design process to ensure near-optimal performance for the set of algorithms used despite the scalable nature of the hardware. A new field multiplication algorithm is used in one of the implementations, improving performance by approximately 50%.

Published in:

Africon Conference in Africa, 2002. IEEE AFRICON. 6th  (Volume:1 )

Date of Conference:

2-4 Oct. 2002