By Topic

Algorithm for unified modular division in GF(p) and GF(2n) suitable for cryptographic hardware

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 $33
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)
A. F. Tenca ; Sch. of Electr. Eng. & Comput. Sci., Oregon State Univ., Corvallis, OR, USA ; L. A. Tawalbeh

A unified algorithm to compute modular division in both GF(p) and GF(2n) fields is presented. It uses a counter variable to keep track of the difference between two field elements, and in this way eliminates the need for comparisons which are usually expensive and time-consuming. The computations in both fields are performed using additions/subtractions and bit shifts, besides using a simple control flow, which makes it suitable for hardware implementation.

Published in:

Electronics Letters  (Volume:40 ,  Issue: 5 )