Fast implementation of extension fields with Typell ONB and cyclic vector multiplication algorithm

Yasuyuki Nogami, Shigeru Shinonaga, Yoshitaka Morikawa

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

Abstract

This paper proposes an extension field named TypeII AOPF. This extension field adopts TypeII optimal normal basis, cyclic vector multiplication algorithm, and Itoh-Tsujii inversion algorithm. The calculation costs for a multiplication and inversion in this field is clearly given with the extension degree. For example, the arithmetic operations in TypeII AOPF Fp5 is about 20% faster than those in OFF Fp5, Then, since CVMA is suitable for parallel processing, we show that Typell AOPF is superior to AOPF as to parallel processing and then show that a multiplication in TypeII AOPF becomes about twice faster by parallelizing the CVMA computation in TypeII AOPF.

Original languageEnglish
Pages (from-to)1200-1208
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE88-A
Issue number5
DOIs
Publication statusPublished - Jan 1 2005

Keywords

  • Extension field
  • Fast implementation
  • Optimal extension field
  • Optimal normal basis
  • Public-key cryptosystem

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Fast implementation of extension fields with Typell ONB and cyclic vector multiplication algorithm'. Together they form a unique fingerprint.

Cite this