Browse > Article
http://dx.doi.org/10.4218/etrij.13.0112.0596

Subquadratic Space Complexity Multiplier for GF($2^n$) Using Type 4 Gaussian Normal Bases  

Park, Sun-Mi (Department of Applied Mathematics, Kongju National University)
Hong, Dowon (Department of Applied Mathematics, Kongju National University)
Seo, Changho (Department of Applied Mathematics, Kongju National University)
Publication Information
ETRI Journal / v.35, no.3, 2013 , pp. 523-529 More about this Journal
Abstract
Subquadratic space complexity multipliers for optimal normal bases (ONBs) have been proposed for practical applications. However, for the Gaussian normal basis (GNB) of type t > 2 as well as the normal basis (NB), there is no known subquadratic space complexity multiplier. In this paper, we propose the first subquadratic space complexity multipliers for the type 4 GNB. The idea is based on the fact that the finite field GF($2^n$) with the type 4 GNB can be embedded into fields with an ONB.
Keywords
Finite field arithmetic; subquadratic space complexity multiplier; normal basis; Gaussian normal basis;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Lidl and H. Niederreiter, An Introduction to Finite Fields and Their Applications, Cambridge: Cambridge University Press, 1986.
2 A.J. Menezes et al., Applications of Finite Fields, Kluwer Academic, 1993.
3 M. Leone, "A New Low Complexity Parallel Multiplier for a Class of Finite Fields," Proc. 3rd Int. Workshop Cryptographic Hardware and Embedded Systems, LNCS 2162, 2001, pp. 160- 170.
4 H. Fan and M.A. Hasan, "Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases," IEEE Trans. Computers, vol. 56, no. 10, Oct. 2007, pp. 1435-1437.   DOI   ScienceOn
5 D.W. Ash, I.F. Blake, and S.A. Vanstone, "Low Complexity Normal Bases," Discrete Appl. Mathematics, vol. 25, no. 3, 1989, pp. 191-210.   DOI   ScienceOn
6 L. Gao and G.E. Sobelman, "Improved VLSI Designs for Multiplication and Inversion in GF(2M) over Normal Bases," Proc. 13th Annual IEEE Int. ASIC/SOC Conf., 2000, pp. 97-101.
7 H. Fan and M.A. Hasan, "A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields," IEEE Trans. Computers, vol. 56, no. 2, Feb. 2007, pp. 224-233.   DOI   ScienceOn
8 C.H. Kim et al., "Modified Serial Multipliers for Type-IV Gaussian Normal Bases," INDOCRYPT, LNCS 3797, 2005, pp. 375-388.
9 J. Adikari et al., "Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases," IEEE Trans. Computers, vol. 62, no. 1, Jan. 2013, pp. 193-199.   DOI   ScienceOn
10 A. Reyhani-Masoleh and M.A. Hasan, "A New Construction of Massey-Omura Parallel Multiplier over GF(2m)," IEEE Trans. Computers, vol. 51, no. 5, 2002, pp. 511-520.   DOI   ScienceOn
11 A. Reyhani-Masoleh, "Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases," IEEE Trans. Computers, vol. 55, no. 1, 2006, pp. 34-47.   DOI   ScienceOn
12 C.H. Kim, S. Kwon, C.P. Hong, "FPGA Implementation of High Performance Elliptic Curve Cryptographic Processor over GF(2163)," J. Syst. Architecture, vol. 54, no. 10, 2008, pp. 893- 900.   DOI   ScienceOn
13 R. Azarderakhsh and A. Reyhani-Masoleh, "A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier," Proc. 3rd Int. Workshop Arithmetic Finite Fields, LNCS 6087, 2010, pp. 25-40.