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 language | English |
|---|---|
| Pages (from-to) | 1500-1507 |
| Number of pages | 8 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E92-A |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Jan 1 2009 |
Keywords
- Basis conversion
- Extension field
- Gauss period normal basis
- Public key cryptography
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 'Finding a basis conversion matrix via prime gauss period normal basis'. Together they form a unique fingerprint.
Cite this
Nogami, Y., Namba, R., & Morikawa, Y. (2009). Finding a basis conversion matrix via prime gauss period normal basis. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E92-A(6), 1500-1507. https://doi.org/10.1587/transfun.E92.A.1500