Question: If we modify n=p*p, Is RSAP still a intractable problems? RSAP input: n st. n=pq with 2p,q primes e st. gcd(e,(n))=1 memodn output: m
If we modify n=p*p, Is RSAP still a intractable problems?

RSAP input: n st. n=pq with 2p,q primes e st. gcd(e,(n))=1 memodn output: m
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
