Finding a basis conversion matrix via prime gauss period normal basis

Yasuyuki Nogami, Ryo Namba, Yoshitaka Morikawa

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper proposes a method to construct a basis conversion matrix between two given bases in F pm . In the proposed method, Gauss period normal basis (GNB) works as a bridge between the two bases. The proposed method exploits this property and construct a basis conversion matrix mostly faster than EDF-based algorithm on average in polynomial time. Finally, simulation results are reported in which the proposed method compute a basis conversion matrix within 30 msec on average with Celeron (2.00 GHz) when mlog p ≈ 160.

Original languageEnglish
Pages (from-to)1500-1507
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE92-A
Issue number6
DOIs
Publication statusPublished - 2009

Fingerprint

Normal Basis
Gauss
p.m.
Polynomials
Polynomial time
Simulation

Keywords

  • Basis conversion
  • Extension field
  • Gauss period normal basis
  • Public key cryptography

ASJC Scopus subject areas

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

Cite this

Finding a basis conversion matrix via prime gauss period normal basis. / Nogami, Yasuyuki; Namba, Ryo; Morikawa, Yoshitaka.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E92-A, No. 6, 2009, p. 1500-1507.

Research output: Contribution to journalArticle

@article{fe70e9c936854c46ac9fea3d0e84b6de,
title = "Finding a basis conversion matrix via prime gauss period normal basis",
abstract = "This paper proposes a method to construct a basis conversion matrix between two given bases in F pm . In the proposed method, Gauss period normal basis (GNB) works as a bridge between the two bases. The proposed method exploits this property and construct a basis conversion matrix mostly faster than EDF-based algorithm on average in polynomial time. Finally, simulation results are reported in which the proposed method compute a basis conversion matrix within 30 msec on average with Celeron (2.00 GHz) when mlog p ≈ 160.",
keywords = "Basis conversion, Extension field, Gauss period normal basis, Public key cryptography",
author = "Yasuyuki Nogami and Ryo Namba and Yoshitaka Morikawa",
year = "2009",
doi = "10.1587/transfun.E92.A.1500",
language = "English",
volume = "E92-A",
pages = "1500--1507",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

TY - JOUR

T1 - Finding a basis conversion matrix via prime gauss period normal basis

AU - Nogami, Yasuyuki

AU - Namba, Ryo

AU - Morikawa, Yoshitaka

PY - 2009

Y1 - 2009

N2 - This paper proposes a method to construct a basis conversion matrix between two given bases in F pm . In the proposed method, Gauss period normal basis (GNB) works as a bridge between the two bases. The proposed method exploits this property and construct a basis conversion matrix mostly faster than EDF-based algorithm on average in polynomial time. Finally, simulation results are reported in which the proposed method compute a basis conversion matrix within 30 msec on average with Celeron (2.00 GHz) when mlog p ≈ 160.

AB - This paper proposes a method to construct a basis conversion matrix between two given bases in F pm . In the proposed method, Gauss period normal basis (GNB) works as a bridge between the two bases. The proposed method exploits this property and construct a basis conversion matrix mostly faster than EDF-based algorithm on average in polynomial time. Finally, simulation results are reported in which the proposed method compute a basis conversion matrix within 30 msec on average with Celeron (2.00 GHz) when mlog p ≈ 160.

KW - Basis conversion

KW - Extension field

KW - Gauss period normal basis

KW - Public key cryptography

UR - http://www.scopus.com/inward/record.url?scp=77956044298&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956044298&partnerID=8YFLogxK

U2 - 10.1587/transfun.E92.A.1500

DO - 10.1587/transfun.E92.A.1500

M3 - Article

VL - E92-A

SP - 1500

EP - 1507

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 6

ER -