Malaysian Journal of Mathematical Sciences, August 2013, Vol. 7(S)
Special Issue: The 3rd International Conference on Cryptology & Computer Security 2012 (CRYPTOLOGY2012)
A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem of $N=p^{2}q$
M. R. K. Ariffin, M. A. Asbullah, N. A. Abu and Z. Mahad
Corresponding Email: rezal@putra.upm.edu.my
Received date: -
Accepted date: -
Abstract:
In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape $N=p^{2}q$. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a complexity order faster than RSA and ECC. For decryption, its speed is better than RSA and is marginally behind ECC. Constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.
Keywords: Integer factorization problem, square root problem, asymmetric cryptosystem
Indexing
