Time-efficient computation of digit serial montgomery multiplication

Wangchen Dai; Huapeng Wu; Ray C. C. Cheung

doi:10.1109/ISICIR.2014.7029543

Time-efficient computation of digit serial montgomery multiplication

Wangchen Dai, Huapeng Wu, Ray C. C. Cheung

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

In this paper, we have proposed a most-significant-digit (MSD) first digit-serial Montgomery multiplication (MM) in a special class of binary field GF (2^m). The field is generated by irreducible pentanomials satisfying predefined conditions as listed in the paper. The value of R(x) is different from the existing reported work: R(x) = x^m or R(x) = x^m-1. We proved that implementation of MM in such special class of binary fields which can be further improved in terms of critical path delay by a maximum of 63%. Comparison results also show that the gate count of the proposed architecture has been reduced compared to the former works.

Original language	English
Title of host publication	Proceedings of the 14th International Symposium on Integrated Circuits, ISIC 2014
Publisher	IEEE
Pages	212-215
ISBN (Print)	9781479948338
DOIs	https://doi.org/10.1109/ISICIR.2014.7029543
Publication status	Published - 2 Feb 2015
Event	14th International Symposium on Integrated Circuits, ISIC 2014 - Singapore, Singapore Duration: 10 Dec 2014 → 12 Dec 2014

Conference

Conference	14th International Symposium on Integrated Circuits, ISIC 2014
Place	Singapore
City	Singapore
Period	10/12/14 → 12/12/14

Research Keywords

digit level
Elliptic Curve Cryptography
finite field
Montgomery multiplication

Access Output

10.1109/ISICIR.2014.7029543

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{82d5e8eb076148d38899346f17f3595f,

title = "Time-efficient computation of digit serial montgomery multiplication",

abstract = "In this paper, we have proposed a most-significant-digit (MSD) first digit-serial Montgomery multiplication (MM) in a special class of binary field GF (2m). The field is generated by irreducible pentanomials satisfying predefined conditions as listed in the paper. The value of R(x) is different from the existing reported work: R(x) = xm or R(x) = xm-1. We proved that implementation of MM in such special class of binary fields which can be further improved in terms of critical path delay by a maximum of 63%. Comparison results also show that the gate count of the proposed architecture has been reduced compared to the former works.",

keywords = "digit level, Elliptic Curve Cryptography, finite field, Montgomery multiplication",

author = "Wangchen Dai and Huapeng Wu and Cheung, {Ray C. C.}",

year = "2015",

month = feb,

day = "2",

doi = "10.1109/ISICIR.2014.7029543",

language = "English",

isbn = "9781479948338",

pages = "212--215",

booktitle = "Proceedings of the 14th International Symposium on Integrated Circuits, ISIC 2014",

publisher = "IEEE",

address = "United States",

note = "14th International Symposium on Integrated Circuits, ISIC 2014 ; Conference date: 10-12-2014 Through 12-12-2014",

}

Time-efficient computation of digit serial montgomery multiplication. / Dai, Wangchen; Wu, Huapeng; Cheung, Ray C. C.
Proceedings of the 14th International Symposium on Integrated Circuits, ISIC 2014. IEEE, 2015. p. 212-215 7029543.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Time-efficient computation of digit serial montgomery multiplication

AU - Dai, Wangchen

AU - Wu, Huapeng

AU - Cheung, Ray C. C.

PY - 2015/2/2

Y1 - 2015/2/2

N2 - In this paper, we have proposed a most-significant-digit (MSD) first digit-serial Montgomery multiplication (MM) in a special class of binary field GF (2m). The field is generated by irreducible pentanomials satisfying predefined conditions as listed in the paper. The value of R(x) is different from the existing reported work: R(x) = xm or R(x) = xm-1. We proved that implementation of MM in such special class of binary fields which can be further improved in terms of critical path delay by a maximum of 63%. Comparison results also show that the gate count of the proposed architecture has been reduced compared to the former works.

AB - In this paper, we have proposed a most-significant-digit (MSD) first digit-serial Montgomery multiplication (MM) in a special class of binary field GF (2m). The field is generated by irreducible pentanomials satisfying predefined conditions as listed in the paper. The value of R(x) is different from the existing reported work: R(x) = xm or R(x) = xm-1. We proved that implementation of MM in such special class of binary fields which can be further improved in terms of critical path delay by a maximum of 63%. Comparison results also show that the gate count of the proposed architecture has been reduced compared to the former works.

KW - digit level

KW - Elliptic Curve Cryptography

KW - finite field

KW - Montgomery multiplication

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84924301138&origin=recordpage

U2 - 10.1109/ISICIR.2014.7029543

DO - 10.1109/ISICIR.2014.7029543

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781479948338

SP - 212

EP - 215

BT - Proceedings of the 14th International Symposium on Integrated Circuits, ISIC 2014

PB - IEEE

T2 - 14th International Symposium on Integrated Circuits, ISIC 2014

Y2 - 10 December 2014 through 12 December 2014

ER -

Time-efficient computation of digit serial montgomery multiplication

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this