Mayfly optimistic hyperelliptic curve cryptosystem

被引:1
作者
Reddy, Ramireddy Nava Teja [1 ]
Kavitha, M. [1 ]
Reddy, G. Sudarsana [2 ]
Yousef, Amr [3 ]
Aboras, Kareem M. [4 ]
Emara, Ahmed [3 ]
Reddy, Ch. Rami [5 ,6 ]
机构
[1] Koneru Lakshmaiah Educ Fdn, Dept CSE, Vaddeswaram, India
[2] SVR Engn Coll, Dept Comp Sci & Engn, Nandyal, India
[3] Univ Business & Technol, Elect Engn Dept, Jeddah, Saudi Arabia
[4] Alexandria Univ, Fac Engn, Dept Elect Power & Machines, Alexandria, Egypt
[5] Joginpally BR Engn Coll, Dept Elect & Elect Engn, Hyderabad, India
[6] Appl Sci Private Univ, Appl Sci Res Ctr, Amman, Jordan
来源
FRONTIERS IN COMPUTER SCIENCE | 2024年 / 6卷
关键词
elliptic curve cryptography; public key encryption; finite field; Jacobian models; hyperelliptic curve cryptosystems and private key; AUTHENTICATION SCHEME; CRYPTOGRAPHY; EFFICIENT; INTERNET;
D O I
10.3389/fcomp.2024.1381850
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Various applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage. Thus, elliptic curve cryptography (ECC) is a methodology that emerged to overcome this issue using its low computation and generation of small keys with its strong encryption strategy. ECC is becoming mandatory and used mostly for public key encryption protocols. ECC has expanded cumulative acceptance in practice due to the reduced bit magnitude of operands compared to RSA for safety level. Previously, protocols designed for ECC suggested calculation of scalar development and it was accomplished in finite fields as projective, affine, and Jacobian simulations of coordinates. Arithmetic operations in a limited area establish the core benefits of the ECC algorithm. Even though ECC generated an issue of complex key generation using its curve formation, to overcome this issue a hyperelliptic curve cryptosystems (HECC) is proposed in this study. HECC perform ECC in the Public Key Cryptography (PKC) domain. This study presented an optimization-based key generation and made a random selection of integers for encrypting the message. Selecting a prime number as the private key and multiplying it to the encrypted message to generate a public key is done. This encrypted message is mapped to the curve to check whether it satisfies the curve equation or not. Once an encrypted message is obtained, it is then sent to a second party for pursuing the message. On the side of the second party, a reverse process called decryption takes place. Thus, a secured transmission of data communication takes place. Implementing this algorithm in MATLAB resulted in 94% accuracy and an error of 6%, which was a higher performance ratio than previous methods.
引用
收藏
页数:18
相关论文
共 31 条
[1]   SE-Enc: A Secure and Efficient Encoding Scheme Using Elliptic Curve Cryptography [J].
Almajed, Hisham N. ;
Almogren, Ahmad S. .
IEEE ACCESS, 2019, 7 :175865-175878
[2]  
Bhageerath Chakravorthy G., 2021, 4 SMART CIT S SCS 20, P338, DOI [10.1049/icp.2022.0366, DOI 10.1049/ICP.2022.0366]
[3]   Energy-aware dynamic Internet of Things security system based on Elliptic Curve Cryptography and Message Queue Telemetry Transport protocol for mitigating Replay attacks [J].
De Rango, Floriano ;
Potrino, Giuseppe ;
Tropea, Mauro ;
Fazio, Peppino .
PERVASIVE AND MOBILE COMPUTING, 2020, 61
[4]   A Novel Efficient Pairing-Free CP-ABE Based on Elliptic Curve Cryptography for IoT [J].
Ding, Sheng ;
Li, Chen ;
Li, Hui .
IEEE ACCESS, 2018, 6 :27336-27345
[5]   Sliding principal component and dynamic reward reinforcement learning based IIoT attack detection [J].
Ellappan, Vijayan ;
Mahendran, Anand ;
Subramanian, Murali ;
Jotheeswaran, Jeevanandam ;
Khadidos, Adil O. ;
Khadidos, Alaa O. ;
Selvarajan, Shitharth .
SCIENTIFIC REPORTS, 2023, 13 (01)
[6]   Fast prime field elliptic-curve cryptography with 256-bit primes [J].
Gueron, Shay ;
Krasnov, Vlad .
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2015, 5 (02) :141-151
[7]   An Analysis of RFID Authentication Schemes for Internet of Things in Healthcare Environment Using Elliptic Curve Cryptography [J].
He, Debiao ;
Zeadally, Sherali .
IEEE INTERNET OF THINGS JOURNAL, 2015, 2 (01) :72-83
[8]   Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography [J].
Ibrahim, Saleh ;
Alharbi, Ayman .
IEEE ACCESS, 2020, 8 :194289-194302
[9]  
Kapoor Vivek, 2008, Ubiquity, V2008, P1
[10]   An elliptic curve cryptography based mutual authentication scheme for smart grid communications using biometric approach [J].
Khan, Akber Ali ;
Kumar, Vinod ;
Ahmad, Musheer .
JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (03) :698-705