Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Lookup table based multiplication technique for GF(2m) with cryptographic significance

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

2 Author(s)
Mahboob, A. ; Dept. of Electron. & Power Eng., Nat. Univ. of Sci. & Technol., Karachi, Pakistan ; Ikram, N.

Finite field multiplication is one of the most important arithmetic operations in the binary finite field GF(2m). Multiplication is required for many cryptographic techniques based on the discrete logarithm problem (DLP) in the multiplicative group of a finite field or additive group of points on an elliptic curve defined over a finite field. A look up table (LUT) based multiplication technique for GF(2m) in polynomial basis is presented, which is applicable to any field size m. Unlike older LUT techniques, this LUT is calculated only once, and for all. The LUT is of constant size and the technique is valid for any m, whereas many older LUT techniques worked only for composite m. It is shown that the new technique results in the lowest number of word-level

Published in:

Communications, IEE Proceedings-  (Volume:152 ,  Issue: 6 )