High-speed hardware implementation of Gaussian normal basis inversion algorithm over F2m

被引:7
作者
Rashidi, Bahram [1 ]
机构
[1] Univ Ayatollah Ozma Boroujerdi, Dept Elect Engn, Boroujerd 6919969411, Iran
来源
MICROELECTRONICS JOURNAL | 2017年 / 63卷
关键词
Finite fields; Elliptic curve cryptosystems; Inversion; Hybrid-double multiplication; NORMAL BASES; MULTIPLICATION; ARCHITECTURE; EFFICIENT;
D O I
10.1016/j.mejo.2017.04.001
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper a high-speed hardware structure for implementation of Itoh-Tsujii Inversion Algorithm (ITA) based on Gaussian normal basis hybrid-double multiplier is presented. To reduce the latency of the inversion operation, a hybrid-double multiplication with the number of clock cycles equal to a single multiplication is applied. Based on an efficient addition chain, double multiplication instead of single multiplication is used for implementation of inversion computations. In this case, two field multiplications are computed in parallel structure by hybriddouble multiplier. The proposed architecture is simple, low-cost and also the number of clock cycles in the structure are reduced compared to existing works. The proposed method over the binary finite fields F-2163 and F-2233 has been successfully verified and implemented on Virtex-4 XC4VLX100 and Virtex-5 XC5VLX110 FPGAs. The computation time of the structure on Virtex-5 FPGA family are 116.25 ns and 128.065 ns over two finite fields F-2163 and F-2233 respectively. The comparison results with other previous implementations of the inversion operation verify that the proposed method has better improvement in terms of execution time and performance.
引用
收藏
页码:138 / 147
页数:10
相关论文
共 19 条
[1]  
[Anonymous], IEICE ELECTRON EXPR
[2]  
[Anonymous], P1363 IEEE
[3]  
[Anonymous], 2000, FIPS1862 NIST DSS US
[4]   LOW COMPLEXITY NORMAL BASES [J].
ASH, DW ;
BLAKE, IF ;
VANSTONE, SA .
DISCRETE APPLIED MATHEMATICS, 1989, 25 (03) :191-210
[5]   Fast Inversion in GF(2m) with Normal Basis Using Hybrid-Double Multipliers [J].
Azarderakhsh, Reza ;
Jarvinen, Kimmo ;
Dimitrov, Vassil .
IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (04) :1041-1047
[6]   Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases [J].
Azarderakhsh, Reza ;
Reyhani-Masoleh, Arash .
IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (04) :744-757
[7]  
Brauer A., 1939, Bull. Amer. Math. Soc, V45, P736, DOI [10.1090/S0002-9904-1939-07068-7, DOI 10.1090/S0002-9904-1939-07068-7]
[8]   Fast and Generic Inversion Architectures Over GF(2m) Using Modified Itoh-Tsujii Algorithms [J].
Hu, Jingwei ;
Guo, Wei ;
Wei, Jizeng ;
Cheung, Ray C. C. .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2015, 62 (04) :367-371
[9]   A FAST ALGORITHM FOR COMPUTING MULTIPLICATIVE INVERSES IN GF(2M) USING NORMAL BASES [J].
ITOH, T ;
TSUJII, S .
INFORMATION AND COMPUTATION, 1988, 78 (03) :171-177
[10]   A Generalization of Addition Chains and Fast Inversions in Binary Fields [J].
Jarvinen, Kimmo ;
Dimitrov, Vassil ;
Azarderakhsh, Reza .
IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (09) :2421-2432