By Topic

Low-complexity Gaussian normal basis multiplier over GF(2m)

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

6 Author(s)
Chiou, C.W. ; Dept. of Comput. Sci. & Inf. Eng., Chien Hsin Univ. of Sci. & Technol., Chungli, Taiwan ; Chang, H.W. ; Liang, W.-Y. ; Lee, C.-Y.
more authors

The elliptic curve cryptosystem (ECC) is very attractive for the use in portable devices because of the small key size. The finite field multiplication over GF(2m) is the most important arithmetic for performing the ECC. Portable devices usually have restricted computation power and memory resources. This work will present a simple method for designing a Gaussian normal basis (GNB) multiplier over GF(2m) needing only fewer computation power whereas keeping lower cost. The proposed Gaussian NB multiplier saves ~57~ space complexity as compared with existing GNB multiplier.

Published in:

Information Security, IET  (Volume:6 ,  Issue: 4 )