Abstract
In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the elliptic curve) to only one ciphertext (one point on the elliptic curve). That is, only one ciphertext is transmitted in the proposed algorithm leading to less transmitting time compared with the classical EEC. The analysis of security illustrates that the proposed algorithm is secure against the attacks of the most common attacking algorithms. Therefore, using the proposed algorithm reduces the transmitting time and provides a high-security level. Thus, the proposed algorithm is secure and efficient, and it provides less transmitting time compared with the classical ECC.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
