One of the most crucial requirements in this digital age is data security. The number of data usage increased drastically now a days, but how far the data is secured is the very big problem, though we have enough cryptographic algorithms for securing real time applications, but the level of the security against modern attacks is not determined. Elliptic Curve based Cryptography (ECC) is the most important cryptographic algorithm for confidentiality and authentication, providing high security level with small length keys when compared to other asymmetric algorithms like RSA, Diffie-Hellman, etc. The real time system usage of ECC is very less due to computational complexity. So, to increase the real time system usage we propose the novel method of combining the ECC with the Chinese Remainder Theorem (CRT), to reduce the larger values to the smaller one, so that the complexity of constructing ECC points can be reduced nearly 40% when compared to the existing ECC based algorithms. Also, its proved that the level of security getting increased and can be used as the fundamental component in real time communication system.

Elliptic Curve Cryptography, Chinese Remainder Theorem, Confidentiality, high Security, Prime Field, Encryption, Decryption