Higher Security for Login System Using RSA and One-time Pad Schemes

Kritsanapong Somsuk


The aim of this paper is to propose a new methodology to increase the security for Login System using RSA and One-time pad (OTP). In the past, the application of RSA with Login System focused on keeping the private key in the server. However, this approach has limitation, in which the overall system can be broken whenever the private key is recovered. Therefore, this paper proposes a different method where the RSA’s private key used for exchanging OTP’s key is kept at the client’s side, whilst the public key and modulus are kept in the database. Furthermore, as a preventive measure from the attackers, the OTP’s key is generated in the server. If it is created at the client’s side, the attackers can trap both the encrypted key and encrypted password from client. Accordingly, they can send both of them to the server without encrypting again and without knowing the password. In addition, the RSA’s process in the server is an encryption process only. That means it takes only a small computation cost for computing modular exponentiation because the public key is always small when compared with the private key. Assuming that the client’s private key is recovered, only the client system whose private key can be found will be broken, which implies that it does not affect to other clients. The experimental results show that although users must remember their private keys and consumes more time, the new proposed system is very strong and secure. Therefore, users who use this system can access the web application without worrying the attackers.


Login System; RSA Scheme; One-time Pad (OPT); Security; Li Ming –Xin’s Method; Time;

Full Text:



L.M. Xin, K. Feng, “An improved sign-in scheme based on RSA cryptosystem”, International Conference on Computer Application and System Modeling, Taiyuan, 2010, pp.35 – 37.

R.L. Rivest, A. Shamir, L. Adleman, “A method for obtaining digital signatures and public key cryptosystems”, Communications of ACM, vol. 21, 1978, pp. 120 – 126.

W.Diffie, M.E. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory, vol. 22, 1976, pp. 644–654.

M. Sarvabhatla, C.M. Reddy , C.S. Vorugunti, “A Secure and Light Weight Authentication Service in Hadoop using One Time Pad”, International Symposium on Big Data and Cloud Computin, Chennai, 2015, pp.81-86.

J.A. Buchmann. “Introduction to Cryptography”, United States of America: Springer-Verlag, 2000.

Big-integer: https://www.npmjs.com/package/big-integer.

O. Nibouche, M. Nibouche, A. Bouridane, “Highspeed FPGA implementation of RSA encryption algorithm”,Electronics, circuits and Systems, vol. 1, 2003, pp. 204-207.

A.Mazzero, L.Romano, G.P. Saggese, N. Mazzocca, “FPGA-based Implementation of a serial RSA processor”, Design, Automation and Test in Europe Conference and Exhibition, 2003, pp. 582 – 587.

J. Elbirt. “Understanding and Applying Cryptography and Data Security”, United Kingdom: Auerbach Publications, 2009.

Class: Math_BigInteger: https://pear.php.net/package/Math_BigInteger /docs/latest/ Math_BigInteger/Math_BigInteger.html.

K. Kim, B. Ndibanje, S. Park, H. Lee, “New Security Login System Using Tap and Gesture on Smartphone Touchscreen”, International Conference on Advanced Communication Technology, Pyeongchang, 2016, pp. 628 – 633.

A. Waheed, M.A. Shah, A. Khan, “Secure login Protocols: An Analysis on Modern Attacks and Solutions”, International Conference on Automation and Computing, Colchester, 2016, pp. 535 – 541.

W. Trappe, L. Washington. “Introduction to Cryptography with Coding Theory”, United States of America: Pearson, 2005.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

ISSN: 2180-1843

eISSN: 2289-8131