Forum: Factoring
2011-09-07, 19:00
|
|
Replies: 2
Views: 620
question to murphys Q2 value
Hello,
i want to test some polynomials with ggnfs and compute their quality with the murphy value Q2. The definition of Q2 is:
Q2:= int(from 0 to pi) rho[(alpha(F1)+log F1(-Acos(t),Bsin(t)))/log...
|
|
Forum: Factoring
2011-09-01, 16:10
|
|
Replies: 797
Views: 64,770
hello guys, i wanted to test a polynomial with...
hello guys, i wanted to test a polynomial with ggnfs. so i created a polynomial with the base-m-method for a 82 digits number. ggnfs ran for some hours (i know that its a "bad" polynomial but i...
|
|
Forum: Factoring
2011-08-10, 19:42
|
|
Replies: 797
Views: 64,770
u are right. it was very stupid to think this...
u are right. it was very stupid to think this will work ^^ of course we need for example irreducible polynomials...ok so will try to create test polynomials. thank you very much for your help
|
|
Forum: Factoring
2011-08-10, 16:35
|
|
Replies: 797
Views: 64,770
|
|
Forum: Factoring
2011-08-10, 15:55
|
|
Replies: 797
Views: 64,770
|
|
Forum: Factoring
2011-08-10, 10:00
|
|
Replies: 797
Views: 64,770
|
|
Forum: Msieve
2011-06-26, 13:18
|
|
Replies: 740
Views: 56,804
hello guys, im a ggnfs noob and factored some...
hello guys, im a ggnfs noob and factored some small rsa numbers with jeffs guide. my question is: is there a command to test my own polynomials? i know that msieve gives me very good polynomials but...
|
