By Topic

Composite field multiplier based on look-up table for elliptic curve cryptography implementation

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)
Paryasto, M.W. ; Sch. of Electr. Eng. & Inf., Inst. Teknol. Bandung, Bandung, Indonesia ; Rahardjo, B. ; Yuliawan, F. ; Muchtadi-Alamsyah, I.
more authors

In this work we propose the use of composite field to implement finite field multiplication, which will be use in ECC implementation. We use 299-bit keylength and GF((213)23) is used instead of GF(2299). Composite field multiplier can be implemented using conventional multiplication operation or using LUT (Look-Up Table). In this paper, LUT is used for multiplication in ground field and Karatsuba Offman Algorithm for the extension field multiplication. A generic architecture for the multiplier is presented. Implementation is done with VHDL with the target device Altera DE -2.

Published in:

Electrical Engineering and Informatics (ICEEI), 2011 International Conference on

Date of Conference:

17-19 July 2011