Secure key generation based on elliptic curve cryptography for cloud storage security

Strong data protection in contemporary cryptographic systems depends critically on the encryption key's strength and security. Regardless of the underlying algorithm, the quality of the keys employed is the primary determinant of the success of any encryption scheme. Even the most advanced cryptosystems are susceptible to cryptanalytic and brute-force assaults due to weak or predictable keys. This study focusses on the development and assessment of a hybrid encryption framework, showing how robust, effectively generated keys can improve security and performance, especially in cloud storage settings where access control and data sensitivity are crucial. According to comparison benchmarks, our results demonstrate that Elliptic Curve Cryptography (ECC) based key generation is 10 to 30 of times faster than RSA(RIVEST-SHAMIR-ADLEMAN) key generation, while still providing 128-bit classical security comparable to ~3072-bit RSA keys. Our produced keys are safe against brute-force assaults because a 256-bit ECC key requires 2128elliptic curve operations to be hacked, making it impractical for attackers to do so. In our effort, we encrypted our key with the one-time pad algorithm, which made our key incredibly strong. Additionally, the smaller ECC keys result in much lower bandwidth and key storage requirements, improving system scalability and performance.

Authors

Institutions

Publication Details

Journal
IET conference proceedings.
Published
2026-02-01
DOI
https://doi.org/10.1049/icp.2025.4783
Primary Topic
Cryptography and Residue Arithmetic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Secure key generation based on elliptic curve cryptography for cloud storage security

Pooja Sapra, Bhagyashree Patil
IET conference proceedings.
Cryptography and Residue Arithmetic
article

Secure key generation based on elliptic curve cryptography for cloud storage security

Pooja Sapra, Bhagyashree Patil
article en

Abstract

Strong data protection in contemporary cryptographic systems depends critically on the encryption key's strength and security. Regardless of the underlying algorithm, the quality of the keys employed is the primary determinant of the success of any encryption scheme. Even the most advanced cryptosystems are susceptible to cryptanalytic and brute-force assaults due to weak or predictable keys. This study focusses on the development and assessment of a hybrid encryption framework, showing how robust, effectively generated keys can improve security and performance, especially in cloud storage settings where access control and data sensitivity are crucial. According to comparison benchmarks, our results demonstrate that Elliptic Curve Cryptography (ECC) based key generation is 10 to 30 of times faster than RSA(RIVEST-SHAMIR-ADLEMAN) key generation, while still providing 128-bit classical security comparable to ~3072-bit RSA keys. Our produced keys are safe against brute-force assaults because a 256-bit ECC key requires 2128elliptic curve operations to be hacked, making it impractical for attackers to do so. In our effort, we encrypted our key with the one-time pad algorithm, which made our key incredibly strong. Additionally, the smaller ECC keys result in much lower bandwidth and key storage requirements, improving system scalability and performance.

IET conference proceedings.Vol. 2025(43)
Parul University (IN)
Openalex Percentile: Top 78%
Cryptography and Residue Arithmetic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.