Abstract
We present a new sequential normal basis multiplier over GF(2m). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supposed to have a shorter or the same critical path delay to that of Reyhani-Masoleh and Hasan. Moreover our method of using a Gaussian normal basis makes it easy to find a basic multiplication table of normal elements. So one can easily construct a circuit array for large finite fields, GF(2m) where m=163,233,283,409,571, i.e. the five recommended fields by NIST for elliptic curve cryptography.
Chapter PDF
Similar content being viewed by others
Keywords
References
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)
Agnew, G.B., Mullin, R.C., Vanstone, S.A.: Fast exponentiation in GF(2n). In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 251–255. Springer, Heidelberg (1988)
Reyhani-Masoleh, A., Hasan, M.A.: Low complexity sequential normal basis multipliers over GF(2m). In: 16th IEEE Symposium on Computer Arithmetic, vol. 16, pp. 188–195 (2003)
Reyhani-Masoleh, A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF(2m). IEEE Trans. Computers 51, 511–520 (2002)
Reyhani-Masoleh, A., Hasan, M.A.: Efficient multiplication beyond optimal normal bases. IEEE Trans. Computers 52, 428–439 (2003)
Menezes, A.J., Blake, I.F., Gao, S., Mullin, R.C., Vanstone, S.A., Yaghoobian, T.: Applications of Finite Fields. Kluwer Academic Publishers, Dordrecht (1993)
Massy, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic, US Patent No. 4587627 (1986)
Paar, C., Fleischmann, P., Roelse, P.: Efficient multiplier architectures for Galois fields GF(24n). IEEE Trans. Computers 47, 162–170 (1998)
Berlekamp, E.R.: Bit-serial Reed-Solomon encoders. IEEE Trans. Inform. Theory 28, 869–874 (1982)
Sunar, B., Koç, Ç.K.: An efficient optimal normal basis type II multiplier. IEEE Trans. Computers 50, 83–87 (2001)
Wu, H., Hasan, M.A., Blake, I.F., Gao, S.: Finite field multiplier using redundant representation. IEEE Trans. Computers 51, 1306–1316 (2002)
Gao, S., von zur Gathen, J., Panario, D.: Orders and cryptographical applications. Math. Comp. 67, 343–352 (1998)
von zur Gathen, J., Shparlinski, I.: Orders of Gauss periods in finite fields. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 208–215. Springer, Heidelberg (1995)
Gao, S., Vanstone, S.: On orders of optimal normal basis generators. Math. Comp. 64, 1227–1233 (1995)
Feisel, S., von zur Gathen, J., Shokrollahi, M.: Normal bases via general Gauss periods. Math. Comp. 68, 271–290 (1999)
NIST, Digital Signature Standard, FIPS Publication, 186-2 (February 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwon, S., Gaj, K., Kim, C.H., Hong, C.P. (2004). Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography. In: Joye, M., Quisquater, JJ. (eds) Cryptographic Hardware and Embedded Systems - CHES 2004. CHES 2004. Lecture Notes in Computer Science, vol 3156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28632-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-28632-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22666-6
Online ISBN: 978-3-540-28632-5
eBook Packages: Springer Book Archive