Abstract
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementation in GF(2m). The finite field GF(2m) with type I optimal normal basis has the disadvantage not applicable to cryptography since m is even. The finite fields GF(2m) with type II optimal normal basis, however, such as GF(2233) are applicable to ECDSA recommended by NIST, and many researchers devote their attentions to efficient arithmetic over them. In this paper, we propose a new type II optimal normal basis parallel multiplier over GF(2m) whose structure and algorithm is clear at a glance, which performs multiplication over GF(2m) in the extension field GF(22m). The time and area complexity of the proposed multiplier is the same as the best known type II optimal normal basis parallel multiplier.
This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Assessment).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lidl, R., Niederreiter, H. (eds.): Introduction to finite fields and its applications. Cambridge Univ. Press, Cambridge (1994)
Menezes, A.J., Blake, I.F., Gao, X.H., Mullin, R.C., Vanstone, S.A., Yaghoobian, T.: Applications of finite fields. Kluwer Academic, Boston (1993)
Koc, C.K., Sunar, B.: Low-Complexity bit-parallel cannonical and normal basis multipliers for a class of finite fields. IEEE Trans. 47(3), 353–356 (1998)
Wu, H., Hasan, M.A.: Low Complexity bit-parallel multipliers for a class of finite fields. IEEE Trans. 47(8), 883–887 (1998)
Reyhani, M.A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF(2m ). IEEE Trans. 51(5), 512–520 (2002)
Sunar, B., Koc, C.K.: An efficient optimal normal basis type II multiplier. IEEE Trans. 50(1), 83–88 (2001)
Wang, C.C., Troung, T.K., Shao, H.M., Deutsch, L.J., Omura, J.K., Reed, I.S.: VLSI architectures for computing multiplications and inverses in GF(2n). IEEE Trans. 34(8), 709–716 (1985)
Kim, C.H., Oh, S., Lim, J.: A new hardware architecture for operations in GF(2n ). IEEE Trans. 51(1), 90–92 (2002)
National Institute of Standards and Technology: Digital Sinature Standard, FIPS 186-2 (2000)
ANSI X 9.63, Public key cryptography for the financial sevices industry: Elliptic curve key agreement and transport protocols, draft (1998)
IEEE P1363, Standard specifications for public key cryptography, Draft 13 (1999)
Blake, I.F., Roth, R.M., Seroussi, G.: Efficient arithmetic in GF(2m ) through palindromic representation, Hewlett-Packard HPL-98-134 (1998)
Elia, M., Leone, M.: On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2m ). IEEE Trans. 51(3), 346–351 (2002)
Gao, S., Lenstra, H.W.: Optimal normal bases, Designs, Codes and Cryptography, vol. 2, pp. 315–323 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, C.H., Kim, Y., Ji, S.Y., Park, I. (2007). A New Parallel Multiplier for Type II Optimal Normal Basis. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-74377-4_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74376-7
Online ISBN: 978-3-540-74377-4
eBook Packages: Computer ScienceComputer Science (R0)