An Enhancement of the Elliptic Curve Cryptography by Using the PairingFunction
DOI:
https://doi.org/10.24237/Abstract
Abstract
In this paper, we propose two new algorithms to increase the security of the Elliptic Curve Cryptography (ECC) by using a pairing function. The two algorithms are based on using two pairing functions, which are the Cantor pairing function and the Elegant pairing function, independently combining the two functions with the ECC. Both algorithms merge two ciphertexts (two points on the elliptic curve EC) into one ciphertext (one point on the elliptic curve EC). This means that only one ciphertext is sent in any of the two proposed algorithms. Sending one ciphertext results in a shorter transmission time. The proposed algorithms are safe according to security analysis. Therefore, the use of the proposed algorithms provides a high level of security and shortens the transmission time compared to classical ECC.
References
[ 1] J. B. Daniel, Search security cryptosystem, SEARCH SECURITY, June (2019)
[ 2] H. B. Habib, Modifying Playfair Cipher Algorithm by using Legendre Symbol, Diyala Journal for Pure Science, 15(04), (2019), DOI(http://dx.doi.org/10.24237/djps.15.04.502A)
[ 3] H. B. Habib, the Application of Chebyshev Polynomial on the Three-Pass Protocol, Diyala Journal for Pure Science, 18(03), (2022), DOI(https://dx.doi.org/10.24237/djps.1803.587A)
[ 4] R. Z. Khalaf, H. B. Habib, S. K. Aljaff, Attacking the Application of Three-Pass Protocol in Hill-Cipher, In Next Generation of Internet of Things: Proceedings of ICNGIoT 2021, 121-127(2021) Springer Singapore, DOI(http://dx.doi.org/10.1007/978-981-16-0666-3_12)
[ 5] V. S. Miller, Use of elliptic curves in cryptography, In H.C. Williams, editor, Advances in Cryptology CRYPTO'85, 218 of Lecture Notes in Computer Science, 417-426(1986)
[ 6] D. R. Stinson, Cryptography Theory and Practice, 3rd edition, (Chapman & Hall/CRC, New York, 2006).
[ 7] MERI, LII, SOME REMARKS ON THE CANTOR PAIRING FUNCTION, LXII -FASC. I, 5565(2007)
[ 8] D. Natanael, and D. Suryani, Text encryption in android chat applications using elliptical curve cryptography (ECC), Procedia Computer Science, 135, 283-291(2018), DOI(http://dx.doi.org/10.1016/j.procs.2018.08.176)
[ 9] S.Y. Yan, Computational number theory and modern cryptography, (John Wiley & Sons, , 2013)
[ 10] K. NEAL, and M. ALFRED, The State of Elliptic Curve Cryptography, Dept. of C&O, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1, (2000), DOI(http://dx.doi.org/10.1023/A:1008354106356)
[ 11] N. Koblitz, Elliptic curve cryptosystems, Mathematics of computation, 48(177), 203-209(1987)
[ 12] G. Cantor, Contributions to the Founding of the Theory of Transfinite Numbers, (Dover, New York, 1955)
[ 13] M. P. Szudzik, Binary Proportional Pairing Functions, ArXiv, abs/1809.06876, DOI(https://doi.org/10.48550/arXiv.1809.06876)
[ 14] A. Solís-Rosas, S. L. Canchola-Magdaleno, M. T. García-Ramírez, An Enhanced Run Length Encoding using an Elegant Pairing Function for Medical Image Compression. International Journal of Computer Science and Software Engineering, 8(5), 104-111(2019)
[ 15] O. W Eide, Elliptic Curve Cryptography Implementation and Performance Testing of Curve Representations, Master’s Thesis Spring (2017)
Downloads
Published
Issue
Section
License
Copyright (c) 2025 CC BY 4.0
This work is licensed under a Creative Commons Attribution 4.0 International License.
