By Topic

A fast-serial finite field multiplier without increasing the number of registers

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

4 Author(s)
Wonjong Kim ; Korea Electron. & Telecommun. Res. Inst., Daejeon, South Korea ; Seungchul Kim ; Hanjin Cho ; Kwang-youb Lee

In this paper, an efficient architecture for the finite field multiplier is proposed. As conventional LFSR (Linear Feedback Shift Registers) architecture need as many registers as speedup factor, the proposed architecture can achieve fast multiplication without increasing the number of registers by sharing the result register for even and odd bits. Modular cells are designed for easy implementation of the multiplier. The experimental results show that the proposed multiplier is 2 times faster than the serial LFSR multiplier with the same number of registers. The low power feature of the proposed multiplier has a big advantage for power critical application including smart card cryptography processors.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:5 )

Date of Conference:

25-28 May 2003