By Topic

Computation of AB2 multiplication in F(2m) using low-complexity systolic architecture

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 $31
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)
Kim, N.-Y. ; Dept. of Comput. Eng., Kyungpook Nat. Univ., Deagu, South Korea ; Kim, H.-S. ; Yoo, K.-Y.

An AB2 operation is known as an efficient basic operation for public key cryptosystems over GF(2m), and various systolic arrays for performing AB2 operations have already been proposed using a standard basis representation. However, these circuits have certain shortcomings for cryptographic application due to their high circuit complexity and long latency. Therefore, further research on an efficient AB2 multiplication circuit is still needed. Accordingly, the authors present a new AB2 algorithm and its systolic realisations in GF(2m). First, a new algorithm is proposed based on the MSB-first scheme using a standard basis representation. Thereafter, bit-parallel and bit-serial systolic power multipliers are derived that exhibit a lower hardware complexity and smaller latency than conventional approaches. In addition, since the proposed architectures incorporate simplicity, regularity, modularity, and pipelinability, they are well suited to VLSI implementation and can be easily applied as a basic architecture for computing an inverse/division operation and in crypto-processor chip design.

Published in:

Circuits, Devices and Systems, IEE Proceedings -  (Volume:150 ,  Issue: 2 )