Name
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 m log p approximate to 160. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transfun.E92.A.1500 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
public key cryptography, extension field, Gauss period normal basis, basis conversion | Prime (order theory),Discrete mathematics,Gauss,Matrix (mathematics),Normal basis,Basis function,Time complexity,Public-key cryptography,Mathematics | Journal |
Volume | Issue | ISSN |
E92A | 6 | 0916-8508 |
Citations | PageRank | References |
2 | 0.52 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasuyuki Nogami | 1 | 146 | 52.44 |
| Ryo Namba | 2 | 4 | 1.30 |
| Yoshitaka Morikawa | 3 | 100 | 14.92 |