Abstract
In this paper a new low complexity parallel multiplier for characteristic two finite fields GF(2m) is proposed. In particular our multiplier works with field elements represented through both Canonical Basis and Type I Optimal Normal Basis (ONB), provided that the irreducible polynomial generating the field is an All One Polynomial (AOP). The main advantage of the scheme is the resulting space complexity, significantly lower than the one provided by the other fast parallel multipliers currently available in the open literature and belonging to the same class.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aho A.V., Hopcroft J.E., Ullman J.D., “The Design and Analysis of Computer Algorithms”, Addison-Wesley, Reading, Mass., 1975.
Drolet G., “A New Representation of Elements of Finite Fields GF(2m) Yelding Small Complexity Arithmetic Circuit”, IEEE Trans. on Computers, vol. 47, pp. 938–946, 1998.
Koç C.K., Sunar B., “Low Complexity Bit-Parallel Canonical and Normal Basis Mutipliers for a Class of Finite Fields”, IEEE Trans. on Computers, vol. 47, pp. 353–356, March 1998.
Omura J., Massey J., “Computational method and apparatus for finite field arithmetic”, U.S. Patent Number 4,587,627, May 1986.
Hasan M.H., Wang M.Z., Bhargava V.K., “Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)”, IEEE Trans. on Computers, vol. 41, no. 8, pp. 962–971, August 1992.
Hasan M.H., Wang M.Z., Bhargava V.K., “A modified Massey-Omura Multiplier for a class of finite fields”, IEEE Trans. on Computers, vol. 42, no. 10, pp. 1278–1280, October 1993.
Itho T., Tsujii S., “Structure of parallel multipliers for a class of Finite Fields GF(2m)”, Information and Computation, vol. 83, pp. 21–40, 1989.
Paar C., “A new architecture for a parallel finite field multiplier with low complexity based on composite fields”, IEEE Trans. on Computers, vol. 45, no. 7, pp. 846–861, July 1996.
Menezes A.J., Blake I., Gao X., Mullin R. Vanstone S. and Yaghoobian T., “Applications of Finite Fields”, Boston, MA: Kluwer Academic Publisher, 1993.
Mastrovito E.D., “VLSI Architectures for multiplication over finite field GF(2m)”, In T. Mora, editor, Applied Algebra Algebraic Algorithms, and Error-Correcting Codes, 6-th International Conference, AAECC-6, pp. 297–309, Roma, Italy, July 1988. New York, NY: Springer-Verlag.
Knuth D.E., “The art of the computing programming”, Vol. 2: Seminumerical algorithms, Adison-Wilsey, Reading, MA., 1969.
Elia M., Leone M. and Visentin C., “Low Complexity bit-parallel multipliers for GF(2m) with generator polynomial x m+x k + 1”, Electronics Letters, Vol. 35, No. 7, April 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leone, M. (2001). A New Low Complexity Parallel Multiplier for a Class of Finite Fields. In: Koç, Ç.K., Naccache, D., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2001. CHES 2001. Lecture Notes in Computer Science, vol 2162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44709-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-44709-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42521-2
Online ISBN: 978-3-540-44709-2
eBook Packages: Springer Book Archive