Finding a Basis Conversion Matrix via Prime Gauss Period Normal Basis

被引:2
作者
Nogami, Yasuyuki [1 ]
Namba, Ryo [1 ]
Morikawa, Yoshitaka [1 ]
机构
[1] Okayama Univ, Commun Network Engn, Okayama 7008530, Japan
关键词
public key cryptography; extension field; Gauss period normal basis; basis conversion; FINITE-FIELDS; NORMAL BASES; ALGORITHM; REPRESENTATIONS; POLYNOMIALS;
D O I
10.1587/transfun.E92.A.1500
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1500 / 1507
页数:8
相关论文
共 18 条
  • [1] [Anonymous], THESIS U ESSEN
  • [2] AOKI K, 2004, OPTIMIZATION PRIME F
  • [3] CANTOR DG, 1981, MATH COMPUT, V36, P587, DOI 10.1090/S0025-5718-1981-0606517-5
  • [4] Normal bases via general Gauss periods
    Feisel, S
    Von zur Gathen, J
    Shokrollahi, MA
    [J]. MATHEMATICS OF COMPUTATION, 1999, 68 (225) : 271 - 290
  • [5] Abelian groups, Gauss periods, and normal bases
    Gao, SH
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2001, 7 (01) : 149 - 164
  • [6] Hess F, 2003, LECT NOTES COMPUT SC, V2656, P374
  • [7] Kaliski BS, 1999, LECT NOTES COMPUT SC, V1556, P81
  • [8] Cyclic vector multiplication algorithm based on a special class of Gauss period normal basis
    Kato, Hidehiro
    Nogami, Yasuyuki
    Yoshida, Tomoki
    Morikawa, Yoshitaka
    [J]. ETRI JOURNAL, 2007, 29 (06) : 769 - 778
  • [9] LENSTRA HW, 1991, MATH COMPUT, V56, P329, DOI 10.1090/S0025-5718-1991-1052099-2
  • [10] LIDL R, 1984, ENCY MATH ITS APPL