Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am trying to find the complexity of a factorization for big numbers.
Which is the best algorithm and which is the complexity of finding a number’s prime factors? Assume that the length of the number is n.
The best know algoritm for factoring integer larger than 100 digits is General number field sieve. It’s complexity is explained on the page that the link links to.
Wikipedia has a nice article about other algoritms: http://en.wikipedia.org/wiki/Integer_factorization