Question: Su ppose the best algorithm known today for finding the prime factors of an n-bit number runs in time 2 c*n*3 (log 2 n)^2/3 .

Su ppose the best algorithm known today for finding the prime factors of an n-bit number runs in time 2 c*n*3 (log2 n)^2/3 . Assuming 4Ghz computers and c = 1 (and that the units of the given expression are clockcycles), estimate the size of numbers that cannot be factored for the next 100 years.

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!