By Topic

Scalable Hardware Architecture for Montgomery Inversion Computation in Dual-Field

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)
Dai Zi-bin ; Inst. of Electron. Technol., Inf. Eng. Univ., Zhengzhou, China ; Qin Fan ; Yang Xiao-hui

Computing the inverse of a number in finite fields GF(p) or GF(2n) is equally important for cryptographic applications. A novel scalable and unified architecture for a Montgomery inversion hardware that operates in both GF(p) and GF(2n) is proposed. The scalable design is the novel modification performed on the fixed hardware to make it occupy a small area and operate with better or similar speed, and it takes less number of clock cycle as the fixed datapath is large and can also achieve high clock frequency. Finally this work has been verified by modeling it in Verilog-HDL, implementing it under 0.18 ¿m CMOS technology. The result indicates that our work has advanced performance than other works.

Published in:

Information Engineering, 2009. ICIE '09. WASE International Conference on  (Volume:2 )

Date of Conference:

10-11 July 2009