Implementation of factorization of RSA using GNFS on ordinary computer
Abul Hasnat, Satyendra Nath Mandal · 2017
Implementation of RSA crypto system requires two prime numbers to produce keys. The security of this algorithm is dependent on these two prime numbers. Larger prime numbers results higher security of the algorithm. The challenge of implementation RSA algorithm is the capability of compiler and hardware mainly processor speed of computer is limited. The ordinary desktop/laptop is unable to check primality of large integer number. The computation time for selection of large prime numbers is huge. The computation of primes from a large integer number is huge time consuming. That is why the special purpose and general purpose factoring algorithm is used for factoring very large integer numbers. In this article, General Number Field Sieve is used for factoring the large integer numbers for implementation of RSA algorithm using ordinary computers.