Question: Given a large integer n you compute k = s(n-1)/2 (mod n) and find that k != +/-1. You then compute x = k2 (mod

Given a large integer n you compute k = s(n-1)/2 (mod n) and find that k != +/-1. You then compute x = k2 (mod n). Prove that if x != 1 then n is not prime, and that if x = 1 then we can factor n.
Given a large integer n you compute k = s(n-1)/2 (mod 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 Databases Questions!