The following four basic algorithms for solving the discretelogarithm problem:
1. Simple, Small PrimepAttacks
2. Shanks “Baby Steps, Giant Steps”
3. Pollard Rho
4. Index Calculus
Can any of the tools (above) that have been developed to attackthe discrete logarithm problem be applied to the RSA system? Afterall, RSA uses exponentiation doesn’t it?
Expert Answer
An answer will be send to you shortly. . . . .