I was wondering what is the best(least) approximate time that even the fastest computers take to find prime factors of a very large integer, eg. $2000$ bit-integer, since it has various implications in cryptography for example the RSA algorithm.
Asked
Active
Viewed 1,046 times
0
-
For general input see https://en.wikipedia.org/wiki/Integer_factorization#Difficulty_and_complexity – gammatester Oct 15 '17 at 18:45
-
@gammatester it says it in order notation, I wish to know approximate time for a 2000 bit integer for eg. – john doe Oct 15 '17 at 18:50
-
Time for which hardware? What implementation do/will you use? Measure the time for smaller bit numbers on your hardware and extrapolate. See also https://en.wikipedia.org/wiki/Integer_factorization_records#Numbers_of_a_general_form – gammatester Oct 15 '17 at 19:03