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

Jun Hong Chen; Ming-Der Shieh; Chien Ming Wu

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

Jun Hong Chen, Ming-Der Shieh, Chien Ming Wu

Department of Electrical Engineering

Research output: Contribution to conference › Paper

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 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

Fingerprint

Cryptography

Hardware

Networks (circuits)

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Cite this

Chen, J. H., Shieh, M-D., & Wu, C. M. (2004). High-speed VLSI design for montgomery inverse over GF(2 ^m). 25-28. Paper presented at 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology, Tainan, Taiwan.

Chen, Jun Hong ; Shieh, Ming-Der ; Wu, Chien Ming. / High-speed VLSI design for montgomery inverse over GF(2 ^m). Paper presented at 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology, Tainan, Taiwan.4 p.

@conference{0632fd5749ff453883e95eadb881b886,

title = "High-speed VLSI design for montgomery inverse over GF(2 m)",

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.",

author = "Chen, {Jun Hong} and Ming-Der Shieh and Wu, {Chien Ming}",

year = "2004",

month = "12",

day = "1",

language = "English",

pages = "25--28",

note = "2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology ; Conference date: 06-12-2004 Through 09-12-2004",

}

Chen, JH, Shieh, M-D & Wu, CM 2004, 'High-speed VLSI design for montgomery inverse over GF(2 ^m)' Paper presented at 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology, Tainan, Taiwan, 04-12-06 - 04-12-09, pp. 25-28.

High-speed VLSI design for montgomery inverse over GF(2 ^m). / Chen, Jun Hong; Shieh, Ming-Der; Wu, Chien Ming.

2004. 25-28 Paper presented at 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology, Tainan, Taiwan.

Research output: Contribution to conference › Paper

TY - CONF

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

AU - Chen, Jun Hong

AU - Shieh, Ming-Der

AU - Wu, Chien Ming

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=21644455947&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21644455947&partnerID=8YFLogxK

M3 - Paper

SP - 25

EP - 28

ER -

Chen JH, Shieh M-D, Wu CM. High-speed VLSI design for montgomery inverse over GF(2 ^m). 2004. Paper presented at 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology, Tainan, Taiwan.