View Single Post
Old 2007-02-22, 20:22   #4
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3×1,181 Posts
Default

Quote:
Originally Posted by xilman View Post
If we could calculate x! mod N in polynomial time it could be used to produce a P-time factoring algorithm. Once more, no such algorithm has been found yet neither has it been proved that an algorithm can not exist.
Hans Riesel also thought so, and mentioned this idea in one of his books. When I pointed this out in sci.crypt back in 1998, Bob said the idea was 'unconvincing'. Nothing has happened recently that gives anyone reason to change that view, unless you can take the AKS primality test as cause for hope that hard problems in number theory are susceptible to solution using simple tools.

jasonp
jasonp is offline   Reply With Quote