By Topic

Fast Algorithm and Hardware Architecture for Modular Inversion in GF(p)

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

2 Author(s)
Chuanpeng Chen ; Sch. of Comput., Wuhan Univ., Wuhan, China ; Zhongping Qin

Modular inversion in the Galois field GF(p) is a part of the kernel arithmetic operations used by many public key cryptosystems, and its high-speed hardware design is necessary. A fast algorithm and its hardware architecture for modular inversion in GF(p) are proposed in this work. The algorithm reduces 30 percent iteration cycles compared with previous algorithms reported in the literature. The proposed hardware architecture contains only two adders performing computadesign is necessary. A fast algorithm and its hardware architecture for modular inversion in GF(p) are proposed in this work. The algorithm reduces 30 percent iteration cycles compared with previous algorithms reported in the literature. The proposed hardware architecture contains only two adders performing computation parallel, and the synthesized results show that our hardware architecturetion parallel, and the synthesized results show that our hardware architecture is more resource-efficient and faster.

Published in:

Intelligent Networks and Intelligent Systems, 2009. ICINIS '09. Second International Conference on

Date of Conference:

1-3 Nov. 2009