A multiplication algorithm with square-free Gauss period normal basis

Yasuyuki Nogami; Kenta Nekado

A multiplication algorithm with square-free Gauss period normal basis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Recent cryptographic applications such as elliptic curve cryptography and pairing-based cryptography often need arithmetic operations, especially vector multiplications in a certain extension field of large order. Thus, the authors have proposed cyclic vector multiplication algorithm (CVMA) with prime Gauss period normal basis (GNB) for accelerating multiplications in extension field. It is efficient for most cases; however, a few cases were not. In order to reduce the few inefficient cases without loss of the convenience of CVMA, this paper extends the idea to square-free GNB with improving CVMA.

Original language	English
Title of host publication	Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
Pages	136-140
Number of pages	5
Publication status	Published - Oct 8 2012
Event	2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 - Seoul, Korea, Republic of Duration: Apr 24 2012 → Apr 26 2012

Publication series

Name	Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
Volume	1

Other

Other	2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
Country	Korea, Republic of
City	Seoul
Period	4/24/12 → 4/26/12

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems

Fingerprint Dive into the research topics of 'A multiplication algorithm with square-free Gauss period normal basis'. Together they form a unique fingerprint.

Cite this

A multiplication algorithm with square-free Gauss period normal basis. / Nogami, Yasuyuki; Nekado, Kenta.

Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012. 2012. p. 136-140 6268483 (Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nogami, Y & Nekado, K 2012, A multiplication algorithm with square-free Gauss period normal basis. in Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012., 6268483, Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012, vol. 1, pp. 136-140, 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012, Seoul, Korea, Republic of, 4/24/12.

@inproceedings{26ead33106c84d8089f9a1a074786a9e,

title = "A multiplication algorithm with square-free Gauss period normal basis",

abstract = "Recent cryptographic applications such as elliptic curve cryptography and pairing-based cryptography often need arithmetic operations, especially vector multiplications in a certain extension field of large order. Thus, the authors have proposed cyclic vector multiplication algorithm (CVMA) with prime Gauss period normal basis (GNB) for accelerating multiplications in extension field. It is efficient for most cases; however, a few cases were not. In order to reduce the few inefficient cases without loss of the convenience of CVMA, this paper extends the idea to square-free GNB with improving CVMA.",

author = "Yasuyuki Nogami and Kenta Nekado",

year = "2012",

month = oct,

day = "8",

language = "English",

isbn = "9788988678671",

series = "Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012",

pages = "136--140",

booktitle = "Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012",

note = "2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 ; Conference date: 24-04-2012 Through 26-04-2012",

}

TY - GEN

T1 - A multiplication algorithm with square-free Gauss period normal basis

AU - Nogami, Yasuyuki

AU - Nekado, Kenta

PY - 2012/10/8

Y1 - 2012/10/8

N2 - Recent cryptographic applications such as elliptic curve cryptography and pairing-based cryptography often need arithmetic operations, especially vector multiplications in a certain extension field of large order. Thus, the authors have proposed cyclic vector multiplication algorithm (CVMA) with prime Gauss period normal basis (GNB) for accelerating multiplications in extension field. It is efficient for most cases; however, a few cases were not. In order to reduce the few inefficient cases without loss of the convenience of CVMA, this paper extends the idea to square-free GNB with improving CVMA.

AB - Recent cryptographic applications such as elliptic curve cryptography and pairing-based cryptography often need arithmetic operations, especially vector multiplications in a certain extension field of large order. Thus, the authors have proposed cyclic vector multiplication algorithm (CVMA) with prime Gauss period normal basis (GNB) for accelerating multiplications in extension field. It is efficient for most cases; however, a few cases were not. In order to reduce the few inefficient cases without loss of the convenience of CVMA, this paper extends the idea to square-free GNB with improving CVMA.

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

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

M3 - Conference contribution

AN - SCOPUS:84867002337

SN - 9788988678671

T3 - Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012

SP - 136

EP - 140

BT - Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012

T2 - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012

Y2 - 24 April 2012 through 26 April 2012

ER -