Abstract
Montgomery inversion algorithm has demonstrated its applicability in applications, such as computing point operations in the elliptic curve cryptography. By modifying the conventional Montgomery inversion algorithm, this paper presents an efficient inversion algorithm over Galois Field GF(2 m), which is very suited for hardware implementation. Due to its structural simplicity, the modified algorithm can be easily mapped onto a high-speed and possibly low-complexity circuit. Results show that a significant performance improvement can be achieved in comparison with previous work, especially for applications of cryptosystems.
Original language | English |
---|---|
Pages | 25-28 |
Number of pages | 4 |
Publication status | Published - 2004 Dec 1 |
Event | 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology - Tainan, Taiwan Duration: 2004 Dec 6 → 2004 Dec 9 |
Other
Other | 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology |
---|---|
Country | Taiwan |
City | Tainan |
Period | 04-12-06 → 04-12-09 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering