2007-10-11, 14:54 | #1 |
"Bob Silverman"
Nov 2003
North of Boston
5^{2}×13×23 Posts |
Interesting Question
Consider 2,980+ C162
We could do this via SNFS with a sextic; dividing out 2^140 + 1; giving an 840 bit number to do. Ow we could do it with a quartic; dividing out 2^196 + 1; giving a 784 bit number to do. Or we could do the C162 with GNFS. I see no way to take advantage of both agebraic factors. The degree is too high. Any bets as to which is easiest? I would guess the C162 with GNFS. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Interesting question from the arxiv | fivemack | Other Mathematical Topics | 4 | 2014-10-11 06:46 |
Interesting hypothetical question. | Uncwilly | Lounge | 21 | 2014-01-20 10:26 |
Interesting Question | R.D. Silverman | Cunningham Tables | 12 | 2010-02-21 02:06 |
Interesting contest... | Xyzzy | Programming | 0 | 2004-05-20 12:52 |
Something Interesting | clowns789 | Hardware | 1 | 2003-12-20 12:36 |