Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography

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.