Factorization Hack of RSA Secret Numbers

Factorization Hack of RSA Secret Numbers

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2016 by IJETT Journal
Volume-37 Number-1
Year of Publication : 2016
Authors : Andysah Putera Utama Siahaan
DOI :  10.14445/22315381/IJETT-V37P204

Citation 

Andysah Putera Utama Siahaan"Factorization Hack of RSA Secret Numbers", International Journal of Engineering Trends and Technology (IJETT), V37(1),15-18 July 2016. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
RSA always uses two big prime numbers to deal with the encryption process. The public key is obtained from the multiplication of both figures. However, we can break it by doing factorization to split the public key into two individual numbers. Cryptanalysis can perform the public key crack by knowing its value. The private key will be soon constructed after the two numbers retrieved. The public key is noted as “N”, while "N = P . Q". This technique is unclassified anymore to solve the RSA public and private key. If it is successfully factored into p and q then ? (N) = (P -1). (Q -1) can be further calculated. By having the public key e, the private key d will be solved. Factorization method is the best way to do the demolition. This study concerns to numbers factorization. GCD calculation will produce the encryption "E" and decryption "D" keys, but it depends on the computer speed.

 References

[1] A. P. U. Siahaan, “RC4 Technique in Visual Cryptography,” SNATIA, Semarang, 2016.
[2] B. R. Ambedkar dan S. S. Bedi, “A New Factorization Method to Factorize RSA Public Key Encryption,” International Journal of Computer Science, vol. 8, no. 6, pp. 242-247, 2011.
[3] H.-M. Sun, M.-E. Wu, W.-C. Ting dan M. J. Hinek, “Dual RSA and Its Security Analysis,” IEEE Transactions on Information Theory, vol. 53, no. 8, 2007.
[4] A. P. U. Siahaan, “Three-Pass Protocol Concept in Hill Cipher Encryption Technique,” SNATI, Yogyakarta, 2016.
[5] N. Hegde dan P. Deepthi, “Pollard RHO Algorithm for Integer Factorization and Discrete Logarithm Problem,” International Journal of Computer Applications, vol. 121, no. 18, pp. 14-17, 2012.
[6] F. Nizar, F. Latheef dan A. Jamal, “RSA Based Encrypted Data Embedding Using APPM,” International Journal of Engineering Trends and Technology, vol. 9, no. 15, pp. 777- 782, 2014.

Keywords
Cryptography, RSA, Public Key, Factorization.