Abstract
In this paper we present an approach for optimizing the implementation of hardware multipliers in GF(2k). We investigate two different strategies namely the reduction of the complexity of the multiplication methods and the combination of different multiplication methods as a means to reduce the area and/or energy consumption of the hardware multiplier. As a means to explore the design space concerning the segmentation of the operands and the selection of the most appropriate multiplication methods we introduce an algorithm which determines the best combination of the multiplication methods. In order to assess the validity of our approach we have benchmarked it against theoretical results reconstructed from literature and against synthesis results using our inhouse 130 nm technology. The former revealed that our designs are up to 32 per cent smaller than those given in literature, the latter showed that our area prediction is extremely accurate.
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
Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba Algorithm for Efficient Implementations. Report 2006/224, Cryptology ePrint Archive (2006), http://eprint.iacr.org/2006/224.pdf
Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers by automata. Soviet Physics-Doklady 7, 595–596 (1963)
Winograd, S.: Arithmetic Complexity of Computations. SIAM (1980)
Montgomery, P.L.: Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Transactions on Computers 54(3), 362–369 (2005)
Fan, H., Hasan, A.: Comments on ”Five, Six, and Seven-Term Karatsuba-Like Formulae”. IEEE Transactions on Computers 56(5), 716–717 (2007)
Sunar, B.: A Generalized Method for Constructing Subquadratic Complexity GF(2k) Multipliers. IEEE Transactions on Computers 53(9), 1097–1105 (2004)
Cenk, M., Koc, C.K., Ozbudak, F.: Polynomial multiplication over finite fields using field extensions and interpolation. In: 19th IEEE Symposium on Computer Arithmetic, pp. 84–91. IEEE Computer Society Press, Portland (2009)
Oseledets, I.: Improved n-term Karatsuba-like Formulae in GF(2). IEEE Transactions on Computers (2010), http://doi.ieeecomputersociety.org/10.1109/TC.2010.233
Horowitz, P.I., Hill, W.: The Art of electronics. Cambridge University Press, New York (1989)
von zur Gathen, J., Shokrollahi, J.: Efficient FPGA-Based Karatsuba Multipliers for Polynomials over \(\mathbb{F}_2\). In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 359–369. Springer, Heidelberg (2006)
Dyka, Z., Langendoerfer, P.: Area efficient hardware implementation of elliptic curve cryptography by iteratively applying Karatsuba method. In: Proc. of the Design, Automation and Test in Europe Conference and Exhibition, vol. 3, pp. 70–75 (2005)
Peter, S., Langendoerfer, P.: An Efficient Polynomial Multiplier GF(2m) and its Application to ECC Designs. In: Proc. of the Design, Automation and Test in Europe Conference and Exhibition, pp. 1253–1258 (2007)
Innovations for High Performance Microelectronics, http://www.ihp-microelectronics.com/
Synopsis, http://www.synopsys.com/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dyka, Z., Langendoerfer, P., Vater, F. (2012). Combining Multiplication Methods with Optimized Processing Sequence for Polynomial Multiplier in GF(2k). In: Armknecht, F., Lucks, S. (eds) Research in Cryptology. WEWoRC 2011. Lecture Notes in Computer Science, vol 7242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34159-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-34159-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34158-8
Online ISBN: 978-3-642-34159-5
eBook Packages: Computer ScienceComputer Science (R0)