By Topic

On "A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits"

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

3 Author(s)
W. Geiselmann ; Inst. fur Algorithmen und Kognitive Syst., Karlsruhe Univ., Germany ; J. Muller-Quade ; R. Steinwandt

For original article see G. Drolet, ibid., vol. 47, no. 9, p. 938-946, (Sept 1998). We characterize the smallest n with GF(2)[X]/(Xn + 1) containing an isomorphic copy of GF(2m). This characterization shows that the representation of finite fields described in a previous issue of the IEEE Transactions on Computers is not "optimal" as claimed. The representation considered there can often be improved significantly.

Published in:

IEEE Transactions on Computers  (Volume:51 ,  Issue: 12 )