Provable secure lightweight hyper elliptic curve‐based communication system for wireless sensor networks |
| |
| Authors: | Vankamamidi S. Naresh Reddi Sivaranjani Nistala V.E.S. Murthy |
| |
| Affiliation: | 1. Department of Computer Science and Engineering, Sri Vasavi Engineering College, Tadepalligudeam, Andhra Pradesh, India;2. Department of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, Andhra Pradesh, India;3. Department of Mathematics, Andhra University, Visakhapatnam, Andhra Pradesh, India |
| |
| Abstract: | It is widely believed that hyper elliptic curve cryptosystems (HECCs) are not attractive for wireless sensor network because of their complexity compared with systems based on lower genera, especially elliptic curves. Our contribution shows that for low cost security applications HECs cryptosystems can outperform elliptic curve cryptosystems. The aim of this paper is to propose a discrete logarithm problem‐based lightweight secure communication system using HEC. We propose this for different genus curves over varied prime fields performing a full scale study of their adaptability to various types of constrained networks. Also, we propose to evaluate the performance of the protocol for computational times with respect to different genus for main operations like Jacobian, Divisor identifications, key generation, signature generation/verification, message encryption, and decryption by changing the size of the field. A formal security model was established based on the hardness of HEC‐Decision Diffie‐Hellman (HEC‐DDH). Finally, a comparative analysis with ECC‐based cryptosystems was made, and satisfactory results were obtained. |
| |
| Keywords: | Diffie‐Hellman elliptic curve genus hyper elliptic curve Jacobian wireless sensor networks |
|
|
