(2005) Efficient unified Montgomery inversion with multi-bit shifting. IEE Proceedings Computers and Digital Techniques, 152 (4). pp. 489-498. ISSN 1350-2387

	HTML (Abstract) c.htm Download (12kB)
Preview	PDF (Paper) C.pdf Download (199kB) | Preview

Abstract

Computation of multiplicative inverses in finite fields GF( p) and GF(2n) is the most time consuming operation in elliptic curve cryptography, especially when affine co-ordinates are used. Since the existing algorithms based on the extended Euclidean algorithm do not permit a fast software implementation, projective co-ordinates, which eliminate almost all of the inversion operations from the curve arithmetic, are preferred. In the paper, the authors demonstrate that affine co-ordinate implementation provides a comparable speed to that of projective co-ordinates with careful hardware realization of existing algorithms for calculating inverses in both fields without utilizing special modulo or irreducible polynomials. They present two inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inversion algorithm. The similarity of the two algorithms allows the design of a single unified hardware architecture that performs the computation of inversion in both fields. They also propose a hardware structure where the field elements are represented using a multi-word format. This feature allows a scalable architecture able to operate in a broad range of precision, which has certain advantages in cryptographic applications. In addition, they include statistical comparison of four inversion algorithms in order to help choose the best one amongst them for implementation onto hardware.

Item Type:	Article
Subjects:	Math Computer Electrical
Department:	College of Computing and Mathematics > Computer Engineering
Depositing User:	ADNAN ABDU GUTUB (gutub
Date Deposited:	01 Mar 2008 13:27
Last Modified:	01 Nov 2019 13:22
URI:	http://eprints.kfupm.edu.sa/id/eprint/175