Question: The following four basic algorithms for solving the discrete logarithm problem: 1. Simple, Small Prime p Attacks 2. Shanks Baby Steps, Giant Steps 3. Pollard

The following four basic algorithms for solving the discrete logarithm 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 attack the discrete logarithm problem be applied to the RSA system? After all, RSA uses exponentiation doesn't it?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!