3 ms·

I think you're looking for the large formula at the top here: https://en.wikipedia.org/wiki/General_number_field_sieve https://en.wikipedia.org/wiki/General_num

by hannob 24d ago

I think you're looking for the large formula at the top here: https://en.wikipedia.org/wiki/General_number_field_sieve https://en.wikipedia.org/wiki/General_number_field_sieve Reference to a scientific paper is given: https://www.ams.org/notices/199612/pomerance.pdf https://www.ams.org/notices/199612/pomerance.pdf

ColinWright 24d ago
That's referring to attacking the factoring problem, which is one method of attacking RSA, and as I said is known to be faster than exponential, but it felt like the comment to which I was replying was talking about something other than just faster factoring. I know there are other attacks on RSA, I was interested to know if the poster to whom I was replying knew of any others (other than factoring, which is kinda obvious). After all, I said: > I know that factoring (which attacks RSA) is sub-exponential, ...