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 |
| Volume | 1 |
| Publication status | Published - 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 |
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 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
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. Vol. 1 2012. p. 136-140 6268483.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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
AN - SCOPUS:84867002337
SN - 9788988678671
VL - 1
SP - 136
EP - 140
BT - Proceedings - 2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
ER -