Table of Contents Author Guidelines Submit a Manuscript
International Journal of Reconfigurable Computing
Volume 2016, Article ID 6371403, 10 pages
http://dx.doi.org/10.1155/2016/6371403
Research Article

FPGA Based High Speed SPA Resistant Elliptic Curve Scalar Multiplier Architecture

1Electrical Engineering Department, COMSATS Institute of Information Technology, Abbottabad, Pakistan
2School of Electronic Engineering, Dublin City University, Dublin, Ireland
3School of Computer & Software, Nanjing University of Information Science and Technology, Nanjing, Jiangsu, China

Received 16 December 2015; Revised 30 March 2016; Accepted 3 May 2016

Academic Editor: Michael Hübner

Copyright © 2016 Khalid Javeed and Xiaojun Wang. 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. V. S. Miller, “Use of elliptic curves in cryptography,” in Advances in Cryptology—CRYPTO '85 Proceedings, pp. 417–426, Springer, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  2. N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of Computation, vol. 48, no. 177, pp. 203–209, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. IEEE standard specifications for Public, “Key cryptography,” IEEE Standards 1363-2000, 2000. View at Google Scholar
  5. P. C. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems,” in Advances in Cryptology—CRYPTO '96, Lecture Notes in Computer Science, pp. 104–113, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  6. F.-X. Standaert, “Introduction to side-channel attacks,” in Secure Integrated Circuits and Systems, I. M. R. Verbauwhede, Ed., Integrated Circuits and Systems, pp. 27–42, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  7. J. Fan, X. Guo, E. De Mulder, P. Schaumont, B. Preneel, and I. Verbauwhede, “State-of-the-art of secure ECC implementations: a survey on known side-channel attacks and countermeasures,” in Proceedings of the IEEE International Symposium on Hardware-Oriented Security and Trust (HOST '10), pp. 76–87, Anaheim, Calif, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Fan and I. Verbauwhede, “An updated survey on secure ECC implementations: attacks, countermeasures and cost,” in Cryptography and Security: From Theory to Applications, pp. 265–282, Springer, 2012. View at Google Scholar
  9. H. Eberle, N. Gura, C. Sheueling, and V. Gupta, “A cryptographic processor for arbitrary elliptic curves over GF(2m),” International Journal of Embedded Systems, vol. 3, no. 4, pp. 241–255, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. J. Lutz and A. Hasan, “High performance FPGA based elliptic curve cryptographic co-processor,” in Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC '04), vol. 2, pp. 486–492, Las Vegas, NV, USA, April 2004. View at Publisher · View at Google Scholar
  11. N. Mentens, S. B. Ors, and B. Preneel, “An FPGA implementation of an elliptic curve processor over GF(2m),” in Proceedings of the 14th ACM Great Lakes Symposium on VLSI (GLSVLSI '04), pp. 454–457, ACM, Boston, Mass, USA, April 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. S. Okada, N. Torii, K. Itoh, and M. Takenaka, “Implementation of elliptic curve cryptographic coprocessor over GF(2m) on an FPGA,” in Cryptographic Hardware and Embedded Systems—CHES 2000, Ç. K. Koç and C. Paar, Eds., vol. 1965 of Lecture Notes in Computer Science, pp. 25–40, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  13. G. Orlando and C. Paar, “A high performance reconfigurable elliptic curve processor for GF (2m),” in Cryptographic Hardware and Embedded Systems—CHES 2000: Second International Workshop Worcester, MA, USA, August 17-18, 2000 Proceedings, vol. 1965 of Lecture Notes in Computer Science, pp. 41–56, Springer, Berlin, Germany, 2000. View at Google Scholar
  14. N. A. Saqib, F. Rodríguez-Henriquez, and A. Díaz-Pérez, “A parallel architecture for fast computation of elliptic curve scalar multiplication over GF (2 m),” in Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS '04), pp. 1967–1974, April 2004. View at Scopus
  15. G. Meurice de Dormale and J.-J. Quisquater, “High-speed hardware implementations of elliptic curve cryptography: a survey,” Journal of Systems Architecture, vol. 53, no. 2-3, pp. 72–84, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. K. Ananyi, H. Alrimeih, and D. Rakhmatov, “Flexible hardware processor for elliptic curve cryptography over NIST prime fields,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 17, no. 8, pp. 1099–1112, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. G. Chen, G. Bai, and H. Chen, “A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 54, no. 5, pp. 412–416, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Daly, W. Marnane, T. Kerins, and E. Popovici, “An FPGA implementation of a GF(p) ALU for encryption processors,” Microprocessors and Microsystems, vol. 28, no. 5-6, pp. 253–260, 2004. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Ghosh, M. Alam, I. S. Gupta, and D. R. Chowdhury, “A robust GF(p) parallel arithmetic unit for public key cryptography,” in Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD '07), pp. 109–115, Lübeck, Germany, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. S. Ghosh, D. Mukhopadhyay, and D. Roychowdhury, “Petrel: power and timing attack resistant elliptic curve scalar multiplier based on programmable GF(p) arithmetic unit,” IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 58, no. 8, pp. 1798–1812, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. S. Ghosh, M. Alam, D. R. Chowdhury, and I. S. Gupta, “Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks,” Computers and Electrical Engineering, vol. 35, no. 2, pp. 329–338, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  22. G. Orlando and C. Paar, “A scalable GF(p) elliptic curve processor architecture for programmable hardware,” in Cryptographic Hardware and Embedded Systems—CHES 2001, pp. 348–363, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  23. S. B. Örs, L. Batina, B. Preneel, and J. Vandewalle, “Hardware implementation of an elliptic curve processor over GF(p),” in Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP '03), pp. 433–443, IEEE, June 2003. View at Publisher · View at Google Scholar · View at Scopus
  24. E. Öztürk, B. Sunar, and E. Savaş, “Low-power elliptic curve cryptography using scaled modular arithmetic,” in Cryptographic Hardware and Embedded Systems—CHES 2004: 6th International Workshop Cambridge, MA, USA, August 11–13, 2004. Proceedings, vol. 3156 of Lecture Notes in Computer Science, pp. 92–106, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  25. A. Satoh and K. Takano, “A scalable dual-field elliptic curve cryptographic processor,” IEEE Transactions on Computers, vol. 52, no. 4, pp. 449–460, 2003. View at Publisher · View at Google Scholar · View at Scopus
  26. W. Shuhua and Z. Yuefei, “A timing-and-area tradeoff GF(p) elliptic curve processor architecture for FPGA,” in Proceedings of the International Conference on Communications, Circuits and Systems, vol. 2, pp. 1308–1312, May 2005. View at Scopus
  27. G. R. Blakley, “A computer algorithm for calculating the product AB modulo M,” IEEE Transactions on Computers, vol. 32, no. 5, pp. 497–500, 1983. View at Google Scholar · View at Scopus
  28. K. Javeed and X. Wang, “Efficient montgomery multiplier for pairing and elliptic curve based cryptography,” in Proceedings of the 9th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP '14), pp. 255–260, Manchester, UK, July 2014. View at Publisher · View at Google Scholar · View at Scopus
  29. D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, Springer, New York, NY, USA, 2004. View at MathSciNet
  30. K. Javeed and X. Wang, “Radix-4 and radix-8 booth encoded interleaved modular multipliers over general Fp,” in Proceedings of the 24th International Conference on Field Programmable Logic and Applications (FPL '14), pp. 1–6, September 2014. View at Publisher · View at Google Scholar · View at Scopus
  31. K. Javeed, X. Wang, and M. Scott, “Serial and parallel interleaved modular multipliers on FPGA platform,” in Proceedings of the 25th International Conference on Field Programmable Logic and Applications (FPL '15), pp. 1–4, London, UK, September 2015. View at Publisher · View at Google Scholar
  32. J. Fan, K. Sakiyama, and I. Verbauwhede, “Elliptic curve cryptography on embedded multicore systems,” Design Automation for Embedded Systems, vol. 12, no. 3, pp. 231–242, 2008. View at Publisher · View at Google Scholar · View at Scopus
  33. C. J. McIvor, M. McLoone, and J. V. McCanny, “Hardware elliptic curve cryptographic processor over GF(p),” IEEE Transactions on Circuits and Systems I, vol. 53, no. 9, pp. 1946–1957, 2006. View at Publisher · View at Google Scholar
  34. A. Daly, W. Marnane, T. Kerins, and E. Popovici, “Fast modular division for application in ECC on reconfigurable logic,” in Field Programmable Logic and Application, pp. 786–795, Springer, Berlin, Germany, 2003. View at Google Scholar