View Single Post
Old 2004-03-03, 14:34   #16
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

236010 Posts
Default

Quote:
Originally Posted by xilman
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 217-digit number) then we could run SNFS on it.
Does the root need to be small, too? If yes, then it's probably rare for such a polynomial and root to exist because there are only 10^81 combinations of coefficients and roots versus 10^217 possibe modulo values. If the root can be as large as N, then there are probably many such polynomials although it may be difficult to find one of them.
wblipp is offline