Open Access Open Access  Restricted Access Subscription Access

Efficient Security for Smart Grid Applications using Elliptic Curve Cryptography with Gaussian Integer Technique

N. Sivasankari

Abstract


In the security based smart applications, there is the need for authentication to maintain the confidentiality and safety of the user details. Elliptic Curve Cryptography is the cornerstone of the embedded applications. Elliptic Curve Cryptography (ECC) provides such security with low key size. The most time-consuming operation in ECC is point multiplication. After careful implementation on point multiplication, there are many possibilities for side channel attacks such as timing attack in the communication channels by measuring the time for one particular point multiplication. In order to reduce the vulnerability of side channel attack the point multiplication is implemented with Gaussian integer technique which is a complicated key expansion algorithm. Gaussian integers are the subset of complex numbers.  Gaussian integer expansion is beneficial to reduce the attacks and the memory requirements of a secure hardware implementation. This paper represents the implementations with Raspberry pi kit as client and server node. A secure one-time password for every transaction is encrypted with   ECC algorithm with reasonable time duration to minimize the side channel and brute force attacks. Even though, point multiplications require more time, gaussian integer multiplication requires less time, transactions by one-time password requires 1.09 seconds for its transaction from server to client.

 

Keywords: Elliptic curve cryptography, security, Raspberry Pi, point multiplication


Full Text:

PDF

References


Chen, Y., Martínez-Ortega, J. F., Castillejo, P., & López, L. (2019). An Elliptic Curve-Based Scalable Data Aggregation Scheme for Smart Grid. IEEE Systems Journal, 14(2), 2066-2077.

Wu, F., Xu, L., Li, X., Kumari, S., Karuppiah, M., & Obaidat, M. S. (2018). A lightweight and provably secure key agreement system for a smart grid with elliptic curve cryptography. IEEE Systems Journal, 13(3), 2830-2838.

Boudia, O. R. M., Senouci, S. M., & Feham, M. (2017). Elliptic curve-based secure multidimensional aggregation for smart grid communications. IEEE Sensors Journal, 17(23), 7750-7757.

Mo, J., Hu, Z., & Lin, Y. (2018). Remote user authentication and key agreement for mobile client–server environments on elliptic curve cryptography. The Journal of Supercomputing, 74(11), 5927-5943.

Ramasamy, P., Ranganathan, V., Palanisamy, V., & Kadry, S. (2020). Securing one-time password generation using elliptic-curve cryptography with self-portrait photograph for mobile commerce application. Multimedia Tools and Applications, 79(23), 17081-17099.

Safieh, M., Thiers, J. P., & Freudenberger, J. (2020, May). Side channel attack resistance of the elliptic curve point multiplication using Gaussian integers. In 2020 Zooming Innovation in Consumer Technologies Conference (ZINC) (pp. 231-236). IEEE.

Safieh, M., Thiers, J. P., & Freudenberger, J. (2020). A compact coprocessor for the elliptic curve point multiplication over Gaussian integers. Electronics, 9(12), 2050.


Refbacks

  • There are currently no refbacks.