Question 2 Let n = pq where p and q are distinct primes. Describe an efficient algorithm that, given both n and v(n) = (
Posted: Thu May 12, 2022 7:55 am
Question 2 Let n = pq where p and q are distinct primes. Describe an efficient algorithm that, given both n and v(n) = (p - 1)(q-1), outputs the factors p, q. Remark: "Efficient" suggests that the algorithm will not perform a brute-force attack. a