Implementation of blom’s key predistribution scheme by using elliptic curve cryptography. Malaysian Journal of Computing, 6 (2). pp. 812-822. ISSN 2231-7473 (2021)
Abstract
Cryptography, along with its various methods is used to serve the security communication purpose. Cryptography is said to be secure if the encryption key is hard to break by the attacker. Initially, Blom’s Key pre-distribution uses an integer finite field which makes this scheme easy to be intervened by attackers and criminal activists. Hence, this study suggests implementing the Elliptic Curve Cryptography to better enhance the security of the original Blom’s. In this proposed scheme, points generated from the elliptic curve will be appointed as public identifiers to be used in the original scheme. The private key and session key of each user are generated using the addition law mathematical operation with public identifiers assigned. Two users who intend to communicate with each other will obtain a common session key. Overall, the modification of Blom’s Key pre-distribution scheme will be presented in this study.
| Item Type: | Article |
|---|---|
| Keywords: | Asymmetric cryptography, Blom’s Key pre-distribution scheme, Elliptic Curve Cryptography |
| Taxonomy: | By Subject > Computer & Mathematical Sciences > Mathematics By Subject > Computer & Mathematical Sciences > Computer Technology and Networking |
| Local Content Hub: | Subjects > Computer and Mathematical Sciences |
| Depositing User: | Eza Eliana Abdul Wahid |
| Date Deposited: | 03 Mar 2022 23:44 |
| Last Modified: | 04 Mar 2022 08:58 |
| Related URLs: |
Actions (login required)
 |
View Item |