Hardware implementation of a novel inversion algorithm

Savaş, Erkay and Naseer, Mansoor (2003) Hardware implementation of a novel inversion algorithm. In: 46th IEEE International Midwest Symposium on Circuits and Systems, Cairo, Egypt

Full text not available from this repository. (Request a copy)


Computation of multiplicative inverses in finite fields GF (p) and GF (2/sup n/) is the most time consuming operation in elliptic curve cryptography especially when affine coordinates are used. Since the existing algorithms based on extended Euclidean algorithm do not permit a fast software implementation, projective coordinates, which eliminate almost all of the inversion operations from the curve arithmetic, are preferred. In this paper, a hardware implementation of inversion algorithms for both binary extension and prime fields is presented. The algorithms are varying slightly from the Montgomery inverse algorithm. A hardware structure, using multiword format is implemented on chip, which allows scalability with a broader precision range
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Euclidean algorithm Montgomery inverse algorithm elliptic curve cryptography finite fields hardware implementation inversion algorithm multiplicative inverses software implementation
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Erkay Savaş
Date Deposited: 19 Feb 2007 02:00
Last Modified: 26 Apr 2022 08:35
URI: https://research.sabanciuniv.edu/id/eprint/1387

Actions (login required)

View Item
View Item