We’re pretty sure that classical computers can’t break RSA (because it is hard to factor large numbers on them), but we know tha
t quantum computers theoretically could. In this question, we will prove a fact that is a key part of Shor’s Algorithm, a quantum algorithm for factoring large numbers quickly1 . Let N = pq where p,q are primes throughout this question. (a) Prove that, for all a ∈ N, there are only four possible values for gcd(a,N). (b) Using part (a), prove that, if r 2 ≡ 1 mod N and r 6≡ ±1 (mod N) (i.e. r is a "nontrivial square root of 1" mod N), then gcd(r −1,N) is one of the prime factors of N. Hint: r2 = 1 mod N can be rewritten as r2 −1 = 0 mod N or (r +1)(r −1) = 0 mod N.
1 answer:
You might be interested in
A triangle is a three-edged polygon with three vertices. It is a fundamental form in geometry. The vertex B is at (1, 5), then vertex B' is at (-2, 11).
<h3>What is a triangle?</h3>A triangle is a three-edged polygon with three vertices. It is a fundamental form in geometry. The sum of all the angle of a triangle is always equal to 180°.
∆ABC is translated 6 units up and 3 units left to create ∆A'B'C'.
The vertex A is at (-1, 2), then vertex A' is at,
A' = (-1-3, 2+6) = (-4, 8)
The vertex B is at (1, 5), then vertex B' is at,
B' = (1-3, 5+6) = (-2, 11)
Learn more about Triangle:
#SPJ1
