Proceedings of the International Conference on Scientific Computing, Amerika Birleşik Devletleri, 01 Temmuz 2013, cilt.1, no.1, ss.101-109
Factorization algorithms have a major role in the computer security and cryptography. Most of the widely used crypto- graphic algorithms, like RSA, are built on the mathematical difficulty of factorization for big prime numbers. This re- search, proposes a new approach to the factorization by using two new enhancements. The new approach is also compared with six different factorization algorithms and evaluated the performance on a big data environment. The algorithms covered are elliptic curve method, quadratic sieve, Fermat’s method, trial division and Pollard rho methods. Success rates are compared over a million of integer numbers with different difficulties. We have im- plemented our own algorithm for random number genera- tion, which is also explained in the paper. We also empiri- cally show that the new approach has an advantage on the factorization attack to RSA.