Question: Using big O notation and assuming limited computing resources, estimate the following: 1. The time needed to factorize an integer number N=157929489 using the number

Using "big O" notation and assuming limited computing resources, estimate the following: 1. The time needed to factorize an integer number N=157929489 using the number field sieve algorithum. 2. The time needed to find a 256-bit AES encryption key k using Grover' s algorithm running on a quantum computer
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
