Question: Say that x 2 = y 2 mod n , but x y mod n and x y mod n . 1 . Show that

Say that x2= y2 mod n, but x y mod n and x y mod n.
1. Show that 1= gcd(x + y, n) cannot hold
2. Explain how to factor n based on the above item (or Show how to find a divisor of n)

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 Programming Questions!