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 - 2009 |
Fingerprint
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 journal › Article
}
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 -