Efficient Elliptic Curve Arithmetic for Lightweight Cryptographic Schemes for IoT Applications
Zakaria Abukari *
Department of Computer Science, Tamale Technical University, Tamale, Ghana.
Edward Yellakuor Baagyere
Department of Computer Science, C. K. Tedam University of Technology and Applied Sciences, Navrongo, Ghana.
Mohammed Muniru Iddrisu
Department of Mathematics, C. K. Tedam University of Technology and Applied Sciences, Navrongo, Ghana.
*Author to whom correspondence should be addressed.
Abstract
The Internet of Things’ (IoT) market is expected to grow exponentially at the global level in the coming years, due to the proliferation of more reliable and faster networks resulting from the extensive rollout of 5 to 10 G mobile networks. By 2025, it is expected that worldwide projection of IoT connected devices will be pegged at 30.9 billion units. Despite the potential benefits of the new technology, security in IoT is a major threat. According to HP, 70% of IoT devices are vulnerable to sniffing attacks and reliable solution is yet to be found. The standard cryptographic algorithms such as RSA and AES provide good security but their utilization in IoT is questionably due to hardware and energy constraints for computationally expensive encryption schemes. However, elliptic curve- based cryptography, a recent paradigm in public key cryptography, achieves the same level of security with smaller key sizes. On the other hand, the total score of performance of an elliptic curve-based cryptosystem depends largely on the efficiency of the arithmetic operations performed in it. It is against this background that this paper proposes efficient elliptic curve arithmetic for implementing ECC based schemes suitable for IoT systems implementations. Elliptic curve point arithmetic implementations in projective coordinate systems over binary extension fields introduce higher efficiencies in software. In this regard, this paper has proposed an improved López-Dahab point arithmetic methods on non-supersingular elliptic curves over . The results show 69.20% improvement in Point Doubling, 44.68% in Point Addition and the scalar point multiplication execution time is decreased by 48.80%.
Keywords: ECC, security, galois fields, field arithmetic, point arithmetic, ECSM, projective coordinate
How to Cite
Downloads
References
Holdowsky J, Mahto M, Raynor ME, Cotteleer M. Inside the Internet of Things (IoT). [Online]; 2015.
Kumar SA, Vealey T, Srivastava H. Security in internet of things: Challenges, solutions and future directions. 49th Hawaii International Conference on System Sciences (HICSS), Koloa, HI, USA; 2016.
Bai TDP, Rabara AS, Jerald V. "Elliptic curve cryptography based security framework for internet of things and cloud computing. International Journal of Computer Science and Technology [IJCST]. 2015;6:223-229.
Bhardwaj I, Kumar A, Bansal M. A review on lightweight cryptography algorithms for data security and authentication in IoTs. 4th IEEE. International Conference on Signal Processing, Computing and Control (ISPCC), Solan; 2017.
Houssain H. Elliptic curve cryptography algorithms resistant against power analysis attacks on resource constrained devices, Clermont-Ferrand II: Université Blaise Pascal; 2012.
Ranger S. "What is the IoT? Everything you need to know about the internet of things right now," [Online]; 2018.
Menezes J, van Oorschot PC, Vanstone SA. Handbook of applied cryptography, Florida: CRC Press; 1996.
Hosseinzadeh Namin P. Efficient implementation of finite field multipliers over binary extension fields, electronic theses and dissertations. 5828; 2016.
Available:https://scholar.uwindsor.ca/etd/5828
Lidl R, Niederreiter H. Introduction to finite fields and their applications, NY, USA: Cambridge University Press, second ed; 1997.
Gartner Inc., "Gartner says 8.4 Billion Connected "Things" Will Be in Use in 2017, Up 31 Percent From 2016," [Online]; 2017.
Mark P, Shangkuan J, Thomas C. "What’s new with the Internet of Things?," [Online]; 2017. Available:https://www.mckinsey.com/industries/semiconductors/our-insights/whats-new-with-the-internet-of-things
Hankerson D, Hernandez JL, Menezes A. "Software implementation of elliptic curve cryptography over binary fields," Koç ÇK, Paar C. (eds) Cryptographic hardware and embedded systems --- CHES 2000 Lecture Notes in Computer Science, vol. Springer, Berlin, Heidelberg.2000;1965:1-23.
Available:https://doi.org/10.1007/3-540-44499-8_1
Al-Somani TF, Amin A. "Hardware implementations of gf (2m) arithmetic using normal basis," Journal of Applied Sciences. 2006;6: 1362-1372.
Guajardo J, Kumar SS, Paar C, Pelzl J. "Efficient software-implementation of finite fields with applications to cryptography," Appl. Math. 2006;93(1):3-32.
Koc CK, Acar T. "Montgomery multiplication in GF(2k)," Design, Codes and Cryptography. 1998;14(1): 57–69.
Itoh T, Tsujii S. "A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases," Information and Computation. 1988;171-177.
Available:http://www.sciencedirect.com/science/article/pii/0890540188900247
Rashidi B, Farashahi RR, Sayedi SM. "High-performance and high-speed implementation of polynomial basis Itoh–Tsujii inversion algorithm over GF(2m)," IET Information Security. 2017;11(2):66-77.
Hankerson D, Menezes A, Vanstone S. Guide to elliptic curve cryptography, New York, USA. Springer-Verlag; 2004.
NIST. "Digital Signature Standard (DSS)," Federal information processing standards publication, FIPS PUB. 2019;186-4:87-101.
Venturini YR. "Performance analysis of parallel modular multiplication algorithms for ECC in mobile devices," Revista de Sistemas de Informaçao da FSMA. 2014;13:57-67.
Rasmi M, Sokhon AA, Daoud MS, Al-Mimi H. "A survey on single scalar point multiplication algorithms forelliptic curves over prime fields," IOSR Journal of Computer Engineering (IOSR-JCE). 2016;18(2)V:31-47.
Rivain M. "Fast and regular algorithms for scalar multiplication over elliptic curves," [Online]; 2011.
Available:https://eprint.iacr.org/2011/338.pdf
Karthikeyan E. "Survey of elliptic curve scalar multiplication algorithms," Int. J. Advanced Networking and Applications. 2012;4(2):1581-1590.
Pamula D. Arithmetic operators on GF(2m) for cryptographic applications: Performance-power consumption - security tradeoffs, Computer Arithmetic. Université Rennes 1, HAL Open Science; 2012.
López J, Dahab R. "Improved algorithms for elliptic curve arithmetic in GF(2n)"," Tavares S, Meijer H. (Eds.): Selected Areas in Cryptography SAC '98, LNCS. 1999;1556:201-212.