Suppose n = pq with p and q distinct odd primes. (a) Suppose that gcd(a, pq) = 1. Prove that if the equation x^2 ≡ a (mod n) has any solutions, then it has four solutions. (b) Suppose that you had a machine that could find all four solutions for some given a. How could you use this machine to factor n?

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter1: Fundamental Concepts Of Algebra
Section1.2: Exponents And Radicals
Problem 90E
icon
Related questions
Question

 Suppose n = pq with p and q distinct odd primes.
(a) Suppose that gcd(a, pq) = 1. Prove that if the equation x^2 ≡ a (mod n) has any solutions, then it has four solutions.
(b) Suppose that you had a machine that could find all four solutions for some given a. How could you use this machine to factor n?

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,