Suppose we modified the Pollard rho method, so the iteration
would be f(x) = x^2 mod...
80.2K
Verified Solution
Link Copied!
Question
Advance Math
Suppose we modified the Pollard rho method, so the iterationwould be f(x) = x^2 mod n instead of f(x) = x^2 + 2 mod n. How wellwould it perform, and why? (You are encouraged to try somemoderately large examples using a computer.)
Answer & Explanation
Solved by verified expert
3.6 Ratings (412 Votes)
Given a positive integer n and that it is composite find a divisor of it Example Input n 12 Output 2 OR 3 OR 4 Input n 187 Output 11 OR 17 Brute approach Test all integers less than n until a divisor is found Improvisation Test all integers less than n A large enough number will still mean a great deal of work Pollards Rho is a prime factorization
See Answer
Get Answers to Unlimited Questions
Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!
Membership Benefits:
Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Zin AI - Your personal assistant for all your inquiries!
