Cyclic vector multiplication algorithm based on a special class of gauss period normal basis

Hidehiro Kato, Yasuyuki Nogami, Tomoki Yoshida, Yoshitaka Morikawa

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

This paper proposes a multiplication algorithm for Fpm, which can be efficiently applied to many pairs of characteristic p and extension degree m except for the case that 8p divides m(p-1). It uses a special class of type-(k, m) Gauss period normal bases. This algorithm has several advantages: it is easily parallelized; Frobenius mapping is easily carried out since its basis is a normal basis; its calculation cost is clearly given; and it is sufficiently practical and useful when parameters k and m are small.

Original languageEnglish
Pages (from-to)769-777
Number of pages9
JournalETRI Journal
Volume29
Issue number6
DOIs
Publication statusPublished - Dec 2007

Keywords

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

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Cyclic vector multiplication algorithm based on a special class of gauss period normal basis'. Together they form a unique fingerprint.

Cite this