Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Hybrid Cryptosystem using Elliptic Curve Cryptography and Caesar Cipher

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2022
C. Swetha, G. Amruthavani, B. Reddaiah

C Swetha, G Amruthavani and B Reddaiah. Hybrid Cryptosystem using Elliptic Curve Cryptography and Caesar Cipher. International Journal of Computer Applications 183(53):24-28, February 2022. BibTeX

	author = {C. Swetha and G. Amruthavani and B. Reddaiah},
	title = {Hybrid Cryptosystem using Elliptic Curve Cryptography and Caesar Cipher},
	journal = {International Journal of Computer Applications},
	issue_date = {February 2022},
	volume = {183},
	number = {53},
	month = {Feb},
	year = {2022},
	issn = {0975-8887},
	pages = {24-28},
	numpages = {5},
	url = {},
	doi = {10.5120/ijca2022921950},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Security is a global issue, and it is one that requires global attention. Security has many facets. The main aspect of the security problem is privacy. Data privacy and security is not a simple job. So, security is possible with suitable security strategies. Security in addition also involves access control, data veracity, system accessibility, and auditing. In fact, 80% of data thrashing is caused by hackers. Encryption is only one approach to securing data. In this work Caesar cipher combined with Elliptic curve cryptography and product cipher system is developed as one of the solutions for security related problems that global environment is facing. This developed product cipher is quite simple with pattern formula. This combination helps in developing strong system. The role of Elliptic curve is very good in developing applications for protection and digital signatures. It also helps in generating pseudo-random numbers and helps in fast encryption and decryption.


  1. Whitfield Diffie and Martin Hellman. New directions in cryptography. IEEE Trans. Inf. Thy., 22:644-654, 1976.
  2. Martin E Hellman and Justin M. Reyneri. Fast computation of discrete logarithms in GF(q). In David Chaum, Ronald L. Rivest, and Alan T. Sherman, editors, Advances in Cryptology: Proceedings of Crypto ’82, New York, 1983. Plenum Press.
  3. Daniel V. Bailey, Christof Paar. “Arithmetic in finite field extensions with application in elliptic curve cryptography”, Journal of Cryptology. 2001: Vol.(14).
  4. Koblitz: “Elliptic curve cryptosystems. Mathematics of Computation. 1987”. Vol. (48):2003-2009.
  5. V. Miller. “Use of elliptic curves in cryptography. Advances in Cryptology-CRYPTO ’85. 1986”, LNCS 218(483), pp. 417-426.
  6. ANSI X9.62. “Public Key Cryptography for the financial services Industry: The Elliptic curve Digital Signature Algorithm (ECDSA)”, 1999.
  7. ANSI X9.62, “Public Key Cryptography for the financial Services Industry: The Elliptic curve Key Agreement & Key Transport Protocols. 2000”.
  8. “IEEE 1363-2000, “Standard Specifications for Public Key Cryptography”.
  9. ISO/IEC 14888, “Information Technology Security Techniques- Digital Signatures., with Appendix- part 3: Certificate based mechanism.
  10. ISO/IEC 15946, “Information Security Technology – Cryptographic Techniques based on Ellitic curve.” 1999.
  11. Ronald Rivest, Adi Shamir, and Leonard Adleman. A method for obtaining digital signatures and public-key cryptosystems. Comm. Assoc. Comput. Mach, 21:120-126, 1978.
  12. NIST, “Digital Signature standard. FIPS publication”, 2000. 186-2.
  13. NIST, “Advanced Encryption Standard”.
  14. N. Koblitz, “A family of Jacobian suitable for Discrete Log Cryptosystem”, Advances in Cryptology – Crypto’88, LNCS, Springer – Verlag. Berlin, Vol. 403. 94-99, 1988.


Security, Elliptic curve cryptography, Caesar cipher, Symmetric Key, Encryption, Decryption