ICCSA 2005: Computational Science and Its Applications – ICCSA 2005 pp 647-656 | Cite as
Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases
Abstract
The arithmetic in finite field GF(2 m ) is important in cryptographic application and coding theory. Especially, the area and time efficient multiplier in GF(2 m ) has many applications in cryptographic fields, for example, ECC. In that point optimal normal basis give attractiveness in area efficient implementation. In [2], Reyhani-Masoleh and Hasan suggested an area efficient linear array for multiplication in GF(2 m ) with slightly increased critical path delay from Agnew et al’s structure. But in [3], S.Kwon et al. suggested an area efficient linear array for multiplication in GF(2 m ) without losing time efficiency from Agnew et al’s structure. We propose a modification of Reyhani-Masoleh and Hasan’s structure with restriction to optimal normal basis type-II. The time and area efficiency of our multiplier is exactly same as that of S.Kwon et al’s structure.
Keywords
Finite fields Massey-Omura multiplier Gaussian Normal Basis ECCPreview
Unable to display preview. Download preview PDF.
References
- 1.Agnew, G.B., Mullin, R.C., Onyszchuk, I., Vanstone, S.A.: An implementation for a fast public key cryptosystem. J. Cryptology 3, 63–79 (1991)MATHCrossRefMathSciNetGoogle Scholar
- 2.Reyhani-Masoleh, A., Hasan, M.A.: Efficient Digit-Serial Normal Basis Multipliers over Binary Extension Fields. ACM Trans. on Embedded Computing Systems (TECS), Special Issue on Embedded Systems and Security 3(3), 575–592 (2004)Google Scholar
- 3.Kwon, S., Gaj, K., Kim, C.H., Hong, C.P.: Efficient linear array for multiplication in GF(2m) using a normal basis for elliptic curve cryptography. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 76–91. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 4.Berlekamp, E.R.: Bit-serial Reed-Solomon encoders. IEEE Trans. Inform. Theory 28, 869–874 (1982)MATHCrossRefGoogle Scholar
- 5.Wu, H., Hasan, M.A., Blake, I.F., Gao, S.: Finite field multiplier using redundant representation. IEEE. Trans. Computers 51, 1306–1316 (2002)CrossRefMathSciNetGoogle Scholar
- 6.Reyhani-Masoleh, A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF(2m). IEEE Trans. Computers 51, 511–520 (2002)CrossRefMathSciNetGoogle Scholar
- 7.Reyhani-Masoleh, A., Hasan, M.A.: Efficient multiplication beyond optimal normal bases. IEEE Trans. on Computers 52, 428–439 (2003)CrossRefGoogle Scholar
- 8.Reyhani-Masoleh, A., Hasan, M.A.: Low Complexity Word-Level Sequential Normal Basis Multipliers. IEEE Transactions on Computers 54(2), 98–110 (2005)CrossRefGoogle Scholar
- 9.Paar, C., Fleischmann, P., Roelse, P.: Efficient multiplier architectures for Galois fields GF(24n). IEEE Trans. Computers 47, 162–170 (1998)CrossRefMathSciNetGoogle Scholar
- 10.Sunar, B., Koc, C.K.: An efficient optimal normal basis type-II multiplier. IEEE Trans. Computers 50, 83–87 (2001)CrossRefMathSciNetGoogle Scholar
- 11.Massey, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic US Patent NO. 4587627 (1986)Google Scholar
- 12.NIST, Digital Signature Standard, FIPS Publication, 186-2 (February 2000)Google Scholar
- 13.ANSI, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm(ECDSA),ANSI x9.62 (1998)Google Scholar
- 14.Gao, S.: Normal Bases over Finite Fields, A thesis for Doctor of Philosophy (1993)Google Scholar
- 15.Kwon, S., Kim, C.H., Hong, C.P.: Efficient exponentiation for a class of finite fields gF(2n) determined by gauss periods. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 228–242. Springer, Heidelberg (2003)CrossRefGoogle Scholar