Reduction of the Cipher Size of Elliptic Curve Cryptography

CH. Suneetha, T. Surendra, CH. Neelima

As the internet provides access to millions of communications in every second around the world, security implications are tremendously increasing. Transfer of important files like banking transactions, tenders, and e commerce require special security and authenticated mechanism in its journey from the sender to the receiver. Recent attention of cryptography is mainly focused on use of elliptic curves in public key cryptosystems. In these days big data and its storage in the cloud is a progressing subject. Security and privacy of huge data is a challenging issue. The present paper explains an innovative block cipher for providing security to big data using elliptic curve over finite field. Though ECC is becoming popular day by day due to the reason that it provides same security level with shorter key length as RSA, it has a drawback that the cipher bandwidth is twice than that of the message. For an n space message, the cipher is 2n elliptic curve affine points. The present mechanism besides providing the robustness focuses on reduction of the cipher bandwidth equal to that of the message.

Volume 12 | Issue 2

Pages: 1211-1217

DOI: 10.5373/JARDCS/V12I2/S20201156