A New Text Encryption Scheme Suitable for Combating Sniffing Attacks in IoT Applications via Non-supersingular Elliptic Curves over Binary Extension Fields
Abstract
Several research works propose the use of Elliptic Curve Cryptography (ECC) to provide security for the Internet of Things (IoT) and cloud computing due to its shorter key requirement of approximately 160-571 bits vs. 1,024-15,360 bits of the others whilst achieving the same level of security. As a result, several ECC based text encryption schemes have been proposed in recent times. However, due to the mathematical foundations behind some of these schemes, there is the need for improvement to make them efficiently suitable for applications targeting IoT platforms. In addition, many of the existing schemes are either limited to some languages and/or use lookup tables which increase their computational overheads in terms of storage and processing. Against this background that this paper proposes a new ECC based text encryption scheme using efficient elliptic curve arithmetic to reduce the computational overheads. The scheme resists the major forms of sniffing attack in software implementation of ECC-based schemes. A test implementation proves that a very high key sensitivity is also achieved.
References
J. Holdowsky, M. Mahto, M. E. Raynor, and M. Cotteleer, Inside the Internet of Things (IoT), 2015.
S. A. Kumar, T. Vealey and H. Srivastava, Security in internet of things: challenges, solutions and future directions, 2016 49th Hawaii International Conference on System Sciences (HICSS), Koloa, HI, USA, 2016. https://doi.org/10.1109/hicss.2016.714
D. Hankerson, J. López Hernandez and A. Menezes, Software implementation of elliptic curve cryptography over binary fields, in: Koç, Ç.K., Paar, C. (eds.), Cryptographic Hardware and Embedded Systems — CHES 2000, Lecture Notes in Computer Science, vol. 1965, Springer, Berlin, Heidelberg, 2000, pp. 1-23. https://doi.org/10.1007/3-540-44499-8_1
D. Sravana Kumar, Ch. Suneetha and A. Chandrasekhar, Encryption of data using elliptic curve over finite fields, International Journal of Distributed and Parallel Systems (IJDPS) 3 (2012), 301-308. https://doi.org/10.5121/ijdps.2012.3125
L. D. Singh and K. M. Singh, Implementation of text encryption using elliptic curve cryptography, Procedia Computer Science 54 (2015), 73-82. https://doi.org/10.1016/j.procs.2015.06.009
V. Kamalakannan and S. Tamilselvan, Security enhancement of text message based on matrix approach using elliptical curve cryptosystem, Procedia Materials Science 10 (2015), 489-496. https://doi.org/10.1016/j.mspro.2015.06.086
D. R. Susantio and I. Muchtadi-Alamsyah, Implementation of elliptic curve cryptography in binary field, Journal of Physics: Conference Series 710 (2016), 012022. https://doi.org/10.1088/1742-6596/710/1/012022
K. Keerthi and B. Surendiran, Elliptic curve cryptography for secured text encryption, in: 2017 International Conference on Circuit, Power and Computing Technologies (ICCPCT), Kollam, 2017. https://doi.org/10.1109/iccpct.2017.8074210
O. Reyad, Text message encoding based on elliptic curve cryptography and a mapping methodology, Information Sciences Letters 7(1) (2018), 7-11. https://doi.org/10.18576/isl/070102
M. A. Naji et al., Cryptanalysis cipher text using new modeling: text encryption using elliptic curve cryptography, in: The 2nd International Conference on Applied Photonics and Electronics 2019 (InCAPE 2019), Putrajaya, Malaysia, 2020. https://doi.org/10.1063/1.5142095
J. Hoffstein, J. Pipher and J. H. Silverman, An Introduction to Mathematical Cryptography, Springer, New York, 2008.
Z. Abukari, E. Y. Baagyere and M. M. Iddrisu, Efficient elliptic curve arithmetic for lightweight cryptographic schemes for IoT applications, Asian Journal of Research in Computer Science 14(4) (2022), 228-237. https://doi.org/10.9734/ajrcos/2022/v14i4307
Unicode Consortium, The Unicode Standard, Version 15.0, 2022. Available online: https://www.unicode.org/versions/Unicode15.0.0/ch01.pdf
NIST, Digital Signature Standard (DSS), Federal Information Processing Standards Publication, FIPS PUB 186-4, 87-101, 2019.
D. Hankerson, A. Menezes and S. Vanstone, Guide to Elliptic Curve Cryptography, New York, USA: Springer-Verlag, 2004.
D. P. Bai et al., Elliptic curve cryptography based security framework for internet of things and cloud computing, International Journal of Computer Science and Technology [IJCST] 6 (2015), 223-229.
R. M. Avanzi et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography, Boca Raton, FL, USA: Chapman & Hall/CRC, 2006.
P. Hosseinzadeh Namin, Efficient implementation of finite field multipliers over binary extension fields, Electronic Theses and Dissertations, 5828, 2016. Retrieved from https://scholar.uwindsor.ca/etd/5828
R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, 2nd ed., NY, USA: Cambridge University Press, 1997.
T. F. Al-Somani and A. Amin, Hardware implementations of GF(2^m) arithmetic using normal basis, Journal of Applied Sciences 6 (2006), 1362-1372. https://doi.org/10.3923/jas.2006.1362.1372
Y. R. Venturini, Performance analysis of parallel modular multiplication algorithms for ECC in mobile devices, Revista de Sistemas de Informaçao da FSMA 13 (2014), 57-67.
D. Pamula, Arithmetic operators on GF(2^m) for cryptographic applications: performance - power consumption - security tradeoffs, Computer Arithmetic, Université Rennes 1, HAL Open Science, 2012.
M. Rasmi et al., A survey on single scalar point multiplication algorithms for elliptic curves over prime fields, IOSR Journal of Computer Engineering (IOSR-JCE) 18 (2006), 31-47.
M. Rivain, Fast and Regular Algorithms for Scalar Multiplication over Elliptic Curves, 2011. Available online: https://eprint.iacr.org/2011/338.pdf
E. Karthikeyan, Survey of elliptic curve scalar multiplication algorithms, Int. J. Advanced Networking and Applications 04 (2006), 1581-1590.
N. T. Raja and K. M. Singh, Secure and efficient text encryption using elliptic curve cryptography, in: Evolution in Computational Intelligence. Smart Innovation, Systems and Technologies, vol. 267, Springer, Singapore, 2022. https://doi.org/10.1007/978-981-16-6616-2_51
This work is licensed under a Creative Commons Attribution 4.0 International License.
.jpg){kind=logo}
