By Topic

Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials

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 $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)
Rodriguez-Henriquez, F. ; CINVESTAV-IPN, Mexico City ; Morales-Luna, G. ; Lopez, J.

In this contribution, we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied to any type of irreducible polynomials. We derive explicit formulas for the space and time complexities associated with the square root operator when working with binary extension fields generated using irreducible trinomials. We show that, for those finite fields, it is possible to compute the square root of an arbitrary field element with equal or better hardware efficiency than the one associated with the field squaring operation. Furthermore, a practical application of the square root operator in the domain of field exponentiation computation is presented.

Published in:

Computers, IEEE Transactions on  (Volume:57 ,  Issue: 4 )