Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 107109, 9 pages
http://dx.doi.org/10.1155/2014/107109
Research Article

Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications

School of Computer Sciences, Universiti Sains Malaysia, Penang 11800, Malaysia

Received 15 November 2013; Revised 4 July 2014; Accepted 5 July 2014; Published 24 July 2014

Academic Editor: Jin L. Kuang

Copyright © 2014 Shahram Jahani 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. N. Boudriga, “Security of mobile communications,” in Proceedings of the IEEE International Conference on Signal Processing and Communications (ICSPC '07), pp. li–lii, 2007.
  2. L. Li and L. Tao, “Security study of mobile business based on WPKI,” in Proceedings of the 8th International Conference on Mobile Business (ICMB '09), pp. 301–304, Dalian, China, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the Association for Computing Machinery, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. W. Diffie and M. E. Hellman, “New directions in cryptography,” Institute of Electrical and Electronics Engineers, vol. 22, no. 6, pp. 644–654, 1976. View at Google Scholar · View at MathSciNet · View at Scopus
  5. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” in Advances in Cryptology, vol. 196 of Lecture Notes in Computer Science, pp. 10–18, 1985. View at Google Scholar
  6. D. M. Gordon, “A survey of fast exponentiation methods,” Journal of Algorithms, vol. 27, no. 1, pp. 129–146, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. N. Nedjah and L. de Macedo Mourelle, “A review of modular multiplication methods and respective hardware implementations,” Informatica, vol. 30, no. 1, pp. 111–129, 2006. View at Google Scholar · View at MathSciNet · View at Scopus
  8. T.-J. Chang, C.-L. Wu, D.-C. Lou, and C.-Y. Chen, “A low-complexity LUT-based squaring algorithm,” Computers & Mathematics with Applications, vol. 57, no. 9, pp. 1494–1501, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. H. Zhengbing, R. M. Al Shboul, and V. P. Shirochin, “An efficient architecture of 1024-bits cryptoprocessor for RSA cryptosystem based on modified Montgomery's algorithm,” in Proceedings of the 4th IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS '07), pp. 643–646, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. J.-C. Bajard and L. Imbert, “A full RNS implementation of RSA,” IEEE Transactions on Computers, vol. 53, no. 6, pp. 769–774, 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. N. S. Szabo and R. I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology, McGraw-Hill, 1967.
  12. P. L. Montgomery, “Modular multiplication without trial division,” Mathematics of Computation, vol. 44, no. 170, pp. 519–521, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. P. Barrett, “Implementing the Rivest, Shamir and Aldham public-key encryption algorithm on standard digital signal processor,” in Proceedings of CRYPTO'86, Lecture Notes in Computer Science, pp. 311–323, 1986.
  14. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, New York, NY, USA, 1997. View at MathSciNet
  15. E. Knuth, The Art of Computer Programming, Addison-Wesley, 1997.
  16. A. Karatsuba and Y. Ofman, “Multiplication of multidigit numbers on automata,” Soviet Physics Doklady, vol. 7, no. 7, pp. 595–596, 1963. View at Google Scholar
  17. A. L. Toom, “The complexity of a scheme of functional elements realizing the multiplication of integers,” Soviet Mathematics, vol. 3, pp. 714–716, 1963. View at Google Scholar
  18. S. A. Cook, On the minimum computation time of functions [Ph.D. thesis], Department of Mathematics, Harvard University, May 1966.
  19. A. Schonhage and V. Strassen, “Schnelle Multiplikation großer Zahlen,” Computing in Science & Engineering, vol. 7, pp. 139–144, 1971. View at Google Scholar
  20. A. Karatsuba and Y. Ofman, “Multiplication of many-digital numbers by automatic computers,” USSR Academy of Sciences, vol. 145, pp. 293–294, 1962. View at Google Scholar
  21. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, 2000.
  22. A. V. Levitin, Introduction to the Design and Analysis of Algorithms, Addison Wesley, 2002.
  23. R. P. Brent, “Fast multiple-precision evaluation of elementary functions,” Journal of the Association for Computing Machinery, vol. 23, no. 2, pp. 242–251, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. J. Von Zur Gathen and J. Shokrollahi, “Fast arithmetic for polynomials over F2in hardware,” in Proceedings of the IEEE Information Theory Workshop (ITW '06), pp. 107–111, Punta del Este, Uruguay, March 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. D. Zuras, “More on squaring and multiplying large integers,” IEEE Transactions on Computers, vol. 43, no. 8, pp. 899–908, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. M. Sadiq and J. Ahmed, “Complexity analysis of multiplication of long integers,” Asian Journal of Information Technology, vol. 5, no. 2, 2006. View at Google Scholar
  27. W. Yang, P. Hseih, and C. Laih, “Efficient squaring of large integers,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E87-A, no. 5, pp. 1189–1192, 2004. View at Google Scholar · View at Scopus
  28. N. Rampersad, J. Shallit, and M. W. Wang, “Avoiding large squares in infinite binary words,” Theoretical Computer Science, vol. 339, no. 1, pp. 19–34, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. D. Zuras, “On squaring and multiplying large integers,” in Proceedings of the IEEE 11th Symposium on Computer Arithmetic, pp. 260–271, July 1993. View at Scopus
  30. S. Jahani, ZOT-MK: a new algorithm for big integer multiplication [dissertation], Universiti Sains Malaysia, 2009.
  31. S. Jahani and A. Samsudin, “Karatsuba multiplication algorithm based on the big-digits and its application in cryptography,” in Proceedings of the 3rd International Conference on Cryptology & Computer Security (Cryptology '12), 2012.
  32. S. Jahani and A. Samsudin, “Karatsuba-ZOT multiplication algorithm and its application in cryptography,” Applied Mechanics and Materials, vol. 241–244, pp. 2417–2423, 2013. View at Publisher · View at Google Scholar · View at Scopus
  33. M. Matsumoto and T. Nishimura, “Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator,” ACM Transactions on Modeling and Computer Simulation, vol. 8, no. 1, pp. 3–30, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus