Table of Contents
VLSI Design
Volume 2018, Article ID 9269157, 7 pages
https://doi.org/10.1155/2018/9269157
Research Article

Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials

Department of Computer Science and Technology, Xinyang Normal University, Nanhu Road 237, Xinyang, Henan, China

Correspondence should be addressed to Yin Li; moc.liamg@ilgnayiefnuy

Received 15 August 2017; Revised 1 December 2017; Accepted 10 December 2017; Published 11 January 2018

Academic Editor: Junqing Sun

Copyright © 2018 Yin Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, New York, NY, USA, 1996. View at MathSciNet
  2. D. E. Knuth, Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley Professional, 3rd edition, 1997. View at MathSciNet
  3. B. Sunar and Ç. K. Koç, “Mastrovito multiplier for all trinomials,” IEEE Transactions on Computers, vol. 48, no. 5, pp. 522–527, 1999. View at Publisher · View at Google Scholar · View at Scopus
  4. H. Fan and Y. Dai, “Fast bit-parallel GF(2n) multiplier for all trinomials,” IEEE Transactions on Computers, vol. 54, no. 4, pp. 485–490, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Wu, “Bit-parallel finite field multiplier and squarer using polynomial basis,” IEEE Transactions on Computers, vol. 51, no. 7, pp. 750–758, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. H. Wu, “Montgomery multiplier and squarer for a class of finite fields,” IEEE Transactions on Computers, vol. 51, no. 5, pp. 521–529, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. C. Negre, “Efficient parallel multiplier in shifted polynomial basis,” Journal of Systems Architecture, vol. 53, no. 2-3, pp. 109–116, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Elia, M. Leone, and C. Visentin, “Low complexity bit-parallel multipliers for GF(2m) with generator polynomial xm + xk + 1,” IEEE Electronics Letters, vol. 35, no. 7, pp. 551-552, 1999. View at Publisher · View at Google Scholar · View at Scopus
  9. H. Fan and M. A. Hasan, “Fast bit parallel-shifted polynomial basis multipliers in GF(2n),” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 53, no. 12, pp. 2606–2615, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  10. A. Hariri and A. Reyhani-Masoleh, “Bit-serial and bit-parallel montgomery multiplication and squaring over GF(2m),” IEEE Transactions on Computers, vol. 58, no. 10, pp. 1332–1345, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. J. Choi, K.-Y. Chang, D. W. Hong, and H. S. Cho, “Hybrid multiplier for GF(2m) defined by some irreducible trinomials,” IEEE Electronics Letters, vol. 40, no. 14, pp. 852-853, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. C.-Y. Lee, “Low-latency bit-parallel systolic multiplier for irreducible xm + xn + 1 with GCD(m, n) = 1,” IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E86A, no. 11, pp. 2844–2852, 2003. View at Google Scholar · View at Scopus
  13. H. Shen and Y. Jin, “Low complexity bit parallel multiplier for GF(2m) generated by equally-spaced trinomials,” Information Processing Letters, vol. 107, no. 6, pp. 211–215, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  14. A. Weimerskirch and C. Paar, Generalizations of the Karatsuba Algorithm for Efficient Implementations, 2003, http://www.crypto.ruhr-uni-bochum.de/imperia/md/content/texte/kaweb.pdfAvailable on.
  15. P. L. Montgomery, “Five, six, and seven-term Karatsuba-like formulae,” IEEE Transactions on Computers, vol. 54, no. 3, pp. 362–369, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. H. Fan, M. Gu, J. Sun, and K.-Y. Lam, “Obtaining more Karatsuba-like formulae over the binary field,” IET Information Security, vol. 6, no. 1, pp. 14C–19, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Fan, J. Sun, M. Gu, and K.-Y. Lam, “Overlap-free Karatsuba-Ofman polynomial multiplication algorithms,” IET Information Security, vol. 4, no. 1, pp. 8–14, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. F. Rodríguez-Henríquez and Ç. K. Koç, “On fully parallel Karatsuba multipler for GF(2m),” in proceedings of the International Conference on Computer Science and Technology (CST, '03), pp. 405–410, ATA Press, 2003.
  19. J. Von Zur Gathen and J. Shokrollahi, “Efficient FPGA-based Karatsuba multipliers for polynomial over 2,” in Proceedings of the 12th Workshop on Selected Areas in Cryptography (SAC '05), vol. 3897, pp. 359–359, Springer. View at MathSciNet
  20. K.-Y. Chang, D. Hong, and H.-S. Cho, “Low complexity bit-parallel multiplier for GF(2m) defined by all-one polynomials using redundant representation,” IEEE Transactions on Computers, vol. 54, no. 12, pp. 1628–1630, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Li, X. Ma, Y. Zhang, and C. Qi, “Mastrovito form of non-recursive karatsuba multiplier for all trinomials,” IEEE Transactions on Computers, vol. 66, no. 9, pp. 1573–1584, 2017. View at Publisher · View at Google Scholar · View at Scopus
  22. H. Fan, “A Chinese remainder theorem approach to bit-parallel GF(2n) polynomial basis multipliers for irreducible trinomials,” IEEE Transactions on Computers, vol. 65, no. 2, pp. 343–C352, 2016. View at Publisher · View at Google Scholar · View at Scopus
  23. T. Zhang and K. K. Parhi, “Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials,” IEEE Transactions on Computers, vol. 50, no. 7, pp. 734–749, 2001. View at Publisher · View at Google Scholar · View at Scopus