Log in to edit a copy.
Download.
Other published documents...
Complexiteit GNFS
3994 days ago by Sander.Demeester
# GNFS a1 = log(exp(1.9 * log(2^512).n()^(1/3) * log(log(2^512).n())^(2/3)),2); a2 = log(exp((64/9).n()^(1/3) * log(2^1024).n()^(1/3) * log(log(2^1024).n()).n()^(1-(1/3))),2); a3 = log(exp((64/9).n()^(1/3) * (log(2)*1024).n()^(1/3) * log((log(2)*1024).n()).n()^(1-(1/3))),2);a1
63.1647372785957
63.1647372785957
# SFNS b1 = log(exp((32/9).n()^(1/3) * log(2^1024).n()^(1/3) * log(log(2^1024).n()).n()^(1-(1/3))),2); b2 = log(exp((32/9).n()^(1/3) * (log(2)*1024).n()^(1/3) * log((log(2)*1024).n()).n()^(1-(1/3))),2);b2
68.8663144865473
68.8663144865473
# QS log(exp(1 * log(2^512).n()^(1/2) * log(log(2^512).n()).n()^(1-(1/2))),2)
65.8579654791447
65.8579654791447
# Making plot x1 = [log(exp(1 * log(2^t)^(1/2) * log(log(2^t))^(1-(1/2))),2) for t in range(2, 1024, 5)]; x2 = [log(exp(1.9 * log(2^t)^(1/3) * log(log(2^t))^(2/3)),2) for t in range(2, 1024, 5)]; p = list_plot(x1); p += list_plot(x2);p