Fast and Generic Inversion Architectures Over GF(2m) Using Modified Itoh-Tsujii Algorithms

被引:20
作者
Hu, Jingwei [1 ]
Guo, Wei [2 ]
Wei, Jizeng [2 ]
Cheung, Ray C. C. [3 ]
机构
[1] Tianjin Univ, Dept Comp Sci, Tianjin 300072, Peoples R China
[2] Tianjin Univ, Dept Comp Engn, Tianjin 300072, Peoples R China
[3] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China
关键词
Binary field; cryptography; Gaussian normal base (GNB); inversion; Itoh-Tsujii algorithm (ITA);
D O I
10.1109/TCSII.2014.2387612
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Finite field inversion is the most computationally intensive field operation in public-key cryptographic algorithms such as elliptic curve cryptography. In this brief, we propose two inversion acceleration techniques for the Itoh-Tsujii algorithm (ITA) over binary extended field. First, we reformulate the ternary-ITA algorithm to generalize the primitive one, so that a universal algorithm procedure for all fields is achieved. Next, we devise a parallel-ITA algorithm to advance the parallelism of ITA. These two techniques are implemented on FPGA platform, and it is experimentally shown that a fast ternary-ITA inverter supporting all NIST fields can be obtained, with 22.9% timing improvement on average compared to the ITA inverter. In addition, the parallel-ITA inverter is a more balancing design that achieves averagely 25.7% of timing decrease compared to the ITA inverter while maintaining 31.3% reduction of area-time product compared to the ternary-ITA inverter.
引用
收藏
页码:367 / 371
页数:5
相关论文
共 16 条
[1]  
Agnew G. B., 1991, Journal of Cryptology, V3, P63, DOI 10.1007/BF00196789
[2]   LOW COMPLEXITY NORMAL BASES [J].
ASH, DW ;
BLAKE, IF ;
VANSTONE, SA .
DISCRETE APPLIED MATHEMATICS, 1989, 25 (03) :191-210
[3]   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
[4]   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
[5]  
Deschamps J., 2009, Hardware Implementation of Finite-Field Arithmetic
[6]   A VLSI ARCHITECTURE FOR FAST INVERSION IN GF(2M) [J].
FENG, GL .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (10) :1383-1386
[7]   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
[8]  
Mell P., 2011, NIST SPEC PUBL, V800, P7, DOI DOI 10.1136/emj.2010.096966
[9]   A Word-Level Finite Field Multiplier Using Normal Basis [J].
Namin, Ashkan Hosseinzadeh ;
Wu, Huapeng ;
Ahmadi, Majid .
IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (06) :890-895
[10]  
Omura J. K., 1986, U.S. Patent, Patent No. [4,587,627, 4587627]