DATA ENCRYPTION USING A DEVELOPED ECC ALGORITHM

Abstract

Although ECC is computationally efficient, scalar multiplication remains one of its most expensive operations. Resource-constrained devices require faster encryption, lower memory usage, and reduced energy consumption without sacrificing security. Study the mathematical foundations of ECC, Analyze limitations of conventional ECC, Propose an optimized ECC algorithm, Improve encryption and decryption performance, Reduce memory consumption and Compare the proposed algorithm with RSA and conventional ECC. Elliptic Curve Cryptography (ECC) offers high security per key bit and is therefore attractive for mobile, cloud, Internet of Things, and resource-constrained systems. However, a common design mistake is to use an elliptic-curve primitive to encrypt arbitrary-length data directly. The proposed work contributes to improving secure communication for IoT devices, embedded systems, cloud computing, financial systems, healthcare, and smart-city applications. This paper proposes a developed ECC hybrid algorithm in which X25519 performs ephemeral-static key agreement, HKDF-SHA-256 derives a session key, and AES-256-GCM provides authenticated bulk-data encryption. The design incorporates domain separation, fresh salt and nonce values, explicit versioning, public-key validation, authenticated metadata, and a structured ciphertext container. A reproducible software experiment compares the proposed framework with an RSA-2048 + AES-256-GCM baseline over plaintext sizes from 1 KB to 1 MB. The measured results show that the ECC-based design substantially reduces asymmetric decryption latency and ciphertext overhead while preserving scalable symmetric encryption performance. Security analysis addresses confidentiality, integrity, forward-secrecy limitations, replay prevention, invalid-key handling, side-channel considerations, and the post-quantum transition.