Modification and Optimization of Pollards's Factorization $\rho$-Method by Means of Recursive Algorithm of Number Calculation Factorization

Investigations of cryptographic algorithms for today are very actually in connection with cybernetic attacks threat and necessity of information protection at the enterprises of various levels including the strategic appointment. The project implementation of John Pollard's factorization ρ-method in the programming language C++ is presented, which works faster than the standard algorithm by 27%. It can facilitate greatly the deciphering operation and cryptographic analysis of various ciphers such as RSA cipher.