High-speed VLSI design for montgomery inverse over GF(2 m)

Jun Hong Chen, Ming Der Shieh, Chien Ming Wu

Research output: Contribution to conferencePaperpeer-review

1 Citation (Scopus)

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 languageEnglish
Pages25-28
Number of pages4
Publication statusPublished - 2004 Dec 1
Event2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology - Tainan, Taiwan
Duration: 2004 Dec 62004 Dec 9

Other

Other2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology
CountryTaiwan
CityTainan
Period04-12-0604-12-09

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'High-speed VLSI design for montgomery inverse over GF(2 <sup>m</sup>)'. Together they form a unique fingerprint.

Cite this