Text Encryption with Improved Elliptic Curve Cryptography
Adeniji Oluwashola David, Olagunju Sulaimon
Journal of Advances in Mathematics and Computer Science · pp. 32–41 · Published 18 Feb 2023
10.9734/jamcs/2023/v38i31749Abstract
The security of data encrypted with an encryption algorithm should be guaranteed such that it is never easy for a third party to recover the message from the encrypted data. To this effect, ECC has been a reliable option. However, the base equation that defines the security of Elliptic Curve Cryptography (ECC) is in the form of a linear equation with one unknown which is easy to solve. The ease with which this equation can be solved is a weak point in the algorithm. Thus, the aim of this research work is to improve the security of ECC by improving the nature of its base linear equation. Elliptic curve arithmetic was used to develop the improved model. The encryption process was specifically targeted and improved from single to double encryption using separate encryption constant for each round of encryption. Simulation was done using a 256 bits key size on selected number of character inputs. Java programming language was used to simulate the model on Net Beans IDE. Results of the research show that despite a longer key size of 256 bits and double encryption process, the improved ECC performed better than the existing ECC model in both encryption and decryption times, but compared to RSA, the encryption is higher while the decryption time is lower. Generally, this shows that the improved ECC out – performed the existing systems and is therefore better.
References (10)
- 1 Elliptic curve cryptography: The serpentine course of a paradigm shift [DOI]
- 2 Defining Information Security [DOI]
- 3 Enhancing security in text messages using matrix based mapping and ElGamal method in elliptic curve cryptography [DOI]
- 4 Security Improvement in Elliptic Curve Cryptography [DOI]
- 5 Multiple Encryption using ECC and its Time Complexity Analysis [DOI]
- 6 A Secured Text Encryption with Near Field Communication (NFC) using Huffman Compression [DOI]
- 7 Using Elliptic Curve Encryption and Decryption for Securing Audio Messages [DOI]
- 8 Evolution of Encryption Techniques and Data Security Mechanisms
- 9 Text Encryption with Advanced Encryption Standard (AES) for Near Field Communication (NFC) Using Huffman Compression [DOI]
- 10 International Journal of Computer Engineering in Research Trends [DOI]
Cited by 11
Kalaichelvi V, Sanjay M P, Vimala Devi P · 2025 Fourth International Conference on Smart Technologies and Systems for Next Generation Computing (ICSTSN) · 2025
Thangam Sivanantham, Sibi Chakkaravarthy Sethuraman · Wireless Personal Communications · 2026
Department of Computer Science D.S. Adegbenro ICT Polytechnic, Eruku-Itori, Ewekoro, Ogun state, Nigeria, Kolawole Bariu Logunleko · international journal of advanced research in computer science · 2025
Donagani Ramakrishna, Mohammed Ali Shaik · IEEE Access · 2025
Gotte Ranjith Kumar, K. Suresh Babu · Lecture Notes in Networks and Systems · 2025
Bilas Haldar, Prabin Kumar Jha · 2023 International Conference on Advanced Computing & Communication Technologies (ICACCTech) · 2023
Showing 6 of 11 known citations — external sources report more than can currently be individually listed.
Related research
- Error Analysis and Detection Procedures for Signature and Authentication Schemes — shares topic coverage
- EC-MAP: A Lightweight Elliptic Curve-based Mutual Authentication Protocol for Secure IoT-Cloud Communication — shares topic coverage
Article metrics
Real usage data collected on this platform.
49
Page views
0
PDF downloads
18
Outbound clicks
11
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.