Quote:
Originally Posted by xilman
Quote:
Originally Posted by wblipp
So looking at the 195 digit cofactor from 2^1188+1, it's not a good candidate.
1. The 195 digit cofactor ...
2. The 358 digit 2^1188+1 ....
3. The primitive polynomial is only 217 digits ...

If you can find a polynomial of degree at most 7 with coefficients all of which are smaller than, say, 9 digits and a corresponding root modulo N (where N is the 217digit number) then we could run SNFS on it. I haven't found any such polynomial.

Is it sufficient for the root to be modulo the C195 cofactor, or does the root really need to be modulo the C217 primitive factor?