
On what mathematical problem does the security of the RSA public-key algorithm primarily rely?
Medium
Create a free account to see more questions and build your own quiz.
Get StartedOn what mathematical problem does the security of the RSA public-key algorithm primarily rely?
Options:
- Discrete logarithm in finite fields
- Integer factorization of large semiprimes
- Elliptic curve isogeny problems
- Shortest vector in a lattice
Correct answer: Integer factorization of large semiprimes
Explanation: RSA's security depends on the difficulty of factoring large semiprime integers (products of two primes). The RSA algorithm was published by Rivest, Shamir and Adleman in 1977.
Created . Updated .