A multiplication algorithm with square-free Gauss period normal basis

Yasuyuki Nogami, Kenta Nekado

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationProceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
Pages136-140
Number of pages5
Volume1
Publication statusPublished - 2012
Event2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 - Seoul, Korea, Republic of
Duration: Apr 24 2012Apr 26 2012

Other

Other2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
CountryKorea, Republic of
CitySeoul
Period4/24/124/26/12

Fingerprint

Cryptography

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

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 (Vol. 1, pp. 136-140). [6268483]

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. Vol. 1 2012. p. 136-140 6268483.

Research output: Chapter in Book/Report/Conference proceedingConference 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. vol. 1, 6268483, pp. 136-140, 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012, Seoul, Korea, Republic of, 4/24/12.
Nogami Y, Nekado K. A multiplication algorithm with square-free Gauss period normal basis. In Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012. Vol. 1. 2012. p. 136-140. 6268483
Nogami, Yasuyuki ; Nekado, Kenta. / A multiplication algorithm with square-free Gauss period normal basis. Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012. Vol. 1 2012. pp. 136-140
@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",
language = "English",
isbn = "9788988678671",
volume = "1",
pages = "136--140",
booktitle = "Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012",

}

TY - GEN

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

AU - Nogami, Yasuyuki

AU - Nekado, Kenta

PY - 2012

Y1 - 2012

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

SN - 9788988678671

VL - 1

SP - 136

EP - 140

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

ER -