Hacker News new | past | comments | ask | show | jobs | submit login

Pretty sure the search cost of GNFS is (bits)^2, the search cost of brute force is 2^(bits), if it was 2^(bits) GNFS would be no better than brute force.

->but only on the order of e^(cbrt(512 * 64/9))

e^(log(n)) = n






Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: