4 (20 pts) Finally, implement a function that can factor large positive integers You will use this to crack your private key from part 3 Use trial division or any other algorithm you are interested in The function should take two arguments factor(n,primes), where n is the integer that you'd like to factor, and primes is a list of primes that you generated using your sieve from part 1 This function should return a list of prime factors for n If n is prime, the list should only contain one element n itself Test it on your n from part 3 to verify that it works (you should recover p and q) 4 (20 pts) Finally, implement a function that can factor large positive integers You will use this to crack your private key from part 3 Use trial division or any other algorithm you are interested in The function should take two arguments factor(n,primes), where n is the integer that you'd like to factor, and primes is a list of primes that you generated using your sieve from part 1 This function should return a list of prime factors for n If n is prime, the list should only contain one element n itself Test it on your n from part 3 to verify that it works (you should recover p and q)

Question

4  (20 pts) Finally, implement a function that can factor large positive integers  You will use this to crack your private key from part 3  Use trial division or any other algorithm you are interested in The function should take two arguments  factor(n,primes), where n is the integer that you'd like to factor, and primes is a list of primes that you generated using your sieve from part 1  This function should return a list of prime factors for n  If n is prime, the list should only contain one element  n itself  Test it on your n from part 3 to verify that it works (you should recover p and q)  4  (20 pts) Finally, implement a function that can factor large positive integers  You will use this to crack your private key from part 3  Use trial division or any other algorithm you are interested in The function should take two arguments  factor(n,primes), where n is the integer that you'd like to factor, and primes is a list of primes that you generated using your sieve from part 1  This function should return a list of prime factors for n  If n is prime, the list should only contain one element  n itself  Test it on your n from part 3 to verify that it works (you should recover p and q)

Accepted Answer

The Answer is in the image, click to view ...

Question

4. (20 pts) Finally, implement a function that can factor large positive integers. You will use this to crack your private key from part 3.

Step by Step Solution

Step: 1

Get Instant Access to Expert-Tailored Solutions

Step: 2

Step: 3

Ace Your Homework with AI

Recommended Textbook for

Database Development For Dummies

Students also viewed these Databases questions

Question

Question

Question

Question

Question

Question

Question

Question

Question

Question

Question

Question