20200103, 17:36  #12  
Nov 2003
7232_{10} Posts 
Quote:
The bet was not just with xilman. Note that it was made over 20 years ago. 

20200103, 18:16  #13  
"Tilman Neumann"
Jan 2016
Germany
3·139 Posts 
Quote:
Was it a particular number, e.g. RSA1024 ? Last fiddled with by Till on 20200103 at 18:16 Reason: removed withespaces 

20200113, 04:10  #14 
Tribal Bullet
Oct 2004
110110100001_{2} Posts 
I kind of wish I had been involved in the factoring field back in 2000, looking back it reads like new improvements were arriving rapidfire. Plus the patent on RSA expired in 2000 and it was set to explode in popularity.

20200113, 13:06  #15  
Aug 2005
Seattle, WA
2·5·157 Posts 
Quote:
Quote:
Last fiddled with by jyb on 20200113 at 13:06 

20200117, 19:44  #16  
"Tilman Neumann"
Jan 2016
Germany
3×139 Posts 
Quote:
Well, I could imagine that innovations still occur but they do not get published because of national interests / security concerns ;) 

20200117, 21:37  #17  
Nov 2003
1110001000000_{2} Posts 
Quote:
It has now been nearly 30 years since the computer science community had a new factoring algorithm. The Number Field Sieve was invented in 1989 by John Pollard. Certainly there have been incremental improvements in the algorithm, the most important of which was the development of block methods for doing the linear algebra. Until that development, linear algebra was done by variations of Gaussian elimination. Because of the time and space complexity for Gaussian elimination factor base sizes (and hence size of composites) were sharply limited. What is strange is that in the period of 1970 through 1989 there were more than a dozen new techniques that appeared. Prior to 1970 all factorization methods were purely exponential: either a variant of Fermat's method or trial division. Then, starting in 1970 we got the following: 1970 CFRAC (known to Lehmer and Powers much earlier but not practical) 1971 Shanks' Class Group Methods (Not practical at the time) 1974 P1 1974 Lehman's Algorithm 1975 Pollard Rho 1976 Shanks' SQUFOF and variations (unpublished) 1978 Schroeppel's Linear Sieve (not practical/not implemented/not published)  exact date uncertain 1980 QS (Pomerance's improvement to the Linear Sieve) 1982 Williams P+1 1985 MPQS 1985 ECM 1985 AtkinsSchnorr Classgroup 1986 SIQS 1987 FFT extensions to P1 and ECM 1989 BachShallit extension to P+1 (not practical) 1989 NFS 1990 Lattice version of NFS 1994 Block Wiedemann (exact date uncertain; based on earlier Coppersmith ideas) 1995 Block Lanczos Note that the last two algorithms are not factoring algorithms per se, but rather methods for dealing with the Linear Algebra that arises in factoring algorithms. WE NEED SOMETHING NEW!!!!! Shor's algorithm is impossible on classical computers and is not included here. When 1000+ qubit quantum computers become a reality, Shor's method will merit inclusion. Note that most of the innovations came in the 80's. 

20200117, 21:40  #18  
Nov 2003
2^{6}·113 Posts 
Quote:
I've heard this claim made frequently from nonprofessionals. It is nonsense. Read e.g. Berstein vs. U.S. State Department. So called "national security concerns" did not suppress publications. 

20200117, 21:54  #19  
"Tilman Neumann"
Jan 2016
Germany
3·139 Posts 
Quote:
Note that I wrote "I could imagine" instead of "I believe". As such I do not claim such thing to be true, as such I think that I do not need to provide evidence. Thanks for the history before. Dana has some slides containing later contributions, if I recall well. The 2005 Kleinjung and Franke paper looks quite good, too. 

20200117, 22:09  #20  
Nov 2003
1C40_{16} Posts 
Quote:
Otherwise, why say it at all if you don't believe it? Further, merely suggesting it spreads it as an "urban legend". Such statements require evidence. Intelligent people do not imagine things without evidence. Last fiddled with by R.D. Silverman on 20200117 at 22:13 

20200117, 23:38  #21 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
13144_{8} Posts 
Coincidentally, I had a discussion with a colleague about this this week. She is aware of publications in cryptography and number theory(her former background) being suppressed in the UK.

20200118, 00:32  #22 
Nov 2003
2^{6}·113 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bad LLD Success Rate  TheMawn  Data  14  20141013 20:19 
Another success (not)!  ATH  Data  133  20120309 17:19 
Success again?!?  ATH  Data  80  20111115 11:40 
Success?... (M46 related)  lycorn  News  631  20100526 10:33 
Success  edorajh  Lounge  5  20040815 16:51 