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
Publication statusPublished - Oct 8 2012
Event2012 8th International Conference on Computing Technology and Information Management, ICCM 2012 - Seoul, Korea, Republic of
Duration: Apr 24 2012Apr 26 2012

Publication series

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

Other

Other2012 8th International Conference on Computing Technology and Information Management, ICCM 2012
CountryKorea, Republic of
CitySeoul
Period4/24/124/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