Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2018, Article ID 4983404, 18 pages
https://doi.org/10.1155/2018/4983404
Research Article

A Vendor-Neutral Unified Core for Cryptographic Operations in GF(p) and GF() Based on Montgomery Arithmetic

1Department of Electronic and Computer Engineering, University of Limerick, Limerick, Ireland
2Institute ProtectIT, Deggendorf Institute of Technology, 94469 Deggendorf, Germany

Correspondence should be addressed to Martin Schramm; ed.ged-ht@mmarhcs.nitram

Received 6 October 2017; Revised 14 March 2018; Accepted 17 May 2018; Published 21 June 2018

Academic Editor: Fawad Ahmed

Copyright © 2018 Martin Schramm 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. D. Minoli, K. Sohraby, and J. Kouns, “IoT security (IoTSec) considerations, requirements,” in Proceedings of 14th IEEE Annual Consumer Communications Networking Conference (CCNC'17), pp. 1006-1007, 2017.
  2. G.-L. Guo, Q. Qian, and R. Zhang, “Different implementations of AES cryptographic algorithm,” in Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conference on Embedded Software and Systems, pp. 1848–1853, 2015.
  3. M. Bafandehkar, S. M. Yasin, R. Mahmod, and Z. M. Hanapi, “Comparison of ECC and RSA algorithm in resource constrained devices,” in Proceedings of the 2013 3rd International Conference on IT Convergence and Security (ICITCS'13), pp. 1–3, 2013.
  4. A. Rupani and G. Sujediya, “A Review of FPGA implementation of Internet of Things,” International Journal of Innovative Research in Computer and Communication Engineering, vol. 4, no. 9, 2016. View at Google Scholar
  5. B. Halak, S. S. Waizi, and A. Islam, “A survey of hardware implementations of elliptic curve cryptographic systems,” Cryptology ePrint Archive 2016/712, 2016. View at Google Scholar
  6. 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
  7. 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 MathSciNet · View at Scopus
  8. H. Kaur and C. Madhu, “Montgomery multiplication methods - A review,” Journal of Application or Innovation in Engineeting & Management, IJAIEM, vol. 2, no. 2, pp. 229–235, 2013. View at Google Scholar
  9. A. F. Tenca and Ç. K. Koç, “A Scalable Architecture for Montgomery Nultiplication,” in Cryptographic Hardware and Embedded Systems, vol. 1717 of Lecture Notes in Computer Science, pp. 94–108, Springer Berlin Heidelberg, Berlin, Heidelberg, 1999. View at Publisher · View at Google Scholar
  10. E. Savas, A. F. Tenca, and Ç. K. Koç, “A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m),” in Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2000), pp. 277–292.
  11. M. Morales-Sandoval and A. D. Perez, “Novel algorithms and hardware architectures for Montgomery Multiplication over GF(p),” Cryptology ePrint Archive 2015/696, 2015. View at Google Scholar
  12. R. Cramer, Public Key Cryptography – PKC 2008, vol. 4939, Springer Berlin Heidelberg, Berlin, Heidelberg, 2008. View at Publisher · View at Google Scholar
  13. A. Mrabet, “A Systolic Hardware Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems, Cryptology ePrint Archive,” Report 2016/487, 2016. View at Google Scholar
  14. Z. Liu et al., “A tiny RSA coprocessor based on optimized systolic Montgomery architecture,” in Proceedings of the International Conference on Security and Cryptography (SECRYPT'11), 2011.
  15. G. D. Sutter, J.-P. Deschamps, and J. L. Imana, “Modular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation,” IEEE Transactions on Industrial Electronics, vol. 58, no. 7, pp. 3101–3109, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  17. M. O. Rabin, “Probabilistic algorithm for testing primality,” Journal of Number Theory, vol. 12, no. 1, pp. 128–138, 1980. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. J. von zur Gathen and I. E. Shparlinski, “Generating safe primes,” Journal of Mathematical Cryptology, vol. 7, no. 4, pp. 333–365, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. W. Diffie, W. Diffie, and M. E. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976. View at Publisher · View at Google Scholar · View at Scopus
  20. 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
  21. BSI - Technical Guidline, “Cryptographic Mechanisms: Recommendations and Key Lengths,” BSI TR-02102-1, 2017. View at Google Scholar
  22. D. Wulansari, M. A. Muslim, and E. Sugiharti, “Implementation of RSA algorithm with chinese remainder theorem for modulus n 1024 bit and 4096 bit,” International Journal of Computer Science and Security, vol. 10, no. 5, pp. 186–194, 2016. View at Google Scholar
  23. V. S. Miller, “Use of elliptic curves in cryptography,” in Proceedings of the Conference on the Theory and Application of Cryptographic Techniques, CRYPTO 1985, pp. 417–426, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  24. B. Zhou, M. Egele, and A. Joshi, “High-performance low-energy implementation of cryptographic algorithms on a programmable SoC for IoT devices,” in Proceedings of the 2017 IEEE High-Performance Extreme Computing Conference (HPEC), 2017.
  25. M. Joye and S. Yen, “The Montgomery Powering Ladder,” in Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems (CHES'02), pp. 291–302, 2002. View at Publisher · View at Google Scholar