Article View: sci.crypt
Article #947Re: RSA-129 contest
From: Robert D. Silverman
Date: Sat, 22 Aug 1992 11:32
Date: Sat, 22 Aug 1992 11:32
44 lines
2768 bytes
2768 bytes
In article <8146.Aug2205.17.2492@virtualnews.nyu.edu> brnstnd@nyu.edu (D. J. Bernstein) writes: stuff deleted... >If you feel that way, don't participate. Other people have submitted >good polynomials and I'm sure the current record won't last long. Nobody >knows an ``accurate figure of merit'' for GNFS polynomials: nobody has >ever exhibited an accurate method of estimating how much time GNFS will >use with various parameters, though GNFS detractors always seem to >pretend otherwise. Too bad you were not at the public-key crypto conference in Oberwolfach last year. I presented the results of quite a few benchmarks for the sieving phase of GNFS on general numbers ranging from 30 to 90 digits. I would characterize this as an accurate way of estimating how much time GNFS will take, wouldn't you? I also have at least an order of magnitude more data than anyone else on the performance of the quadratic sieve. From this data it is not difficult to project a crossover point of around 135 digits. The data I have also shows how much speedup is obtained by reducing the size of the coefficients. My data says that you will need to find 14 digit coefficients for GNFS to compete with PPMPQS in doing RSA-129. But Dan says he does not believe this 'pessimistic estimate'. I am not 'pretending' anything, despite Dan's insults. I have real data. Dan's labelling of detractors as 'pretending' is both insulting and unprofessional. Of course he can't back up this belief, because he doesn't have enough data on the performance of both methods. Of course he is now obtaining data on the sieving part of GNFS now that he has it coded. But he still lacks data on QS. Lenstra and Manasse have done a few dozen numbers with QS. I've done in excess of 500. I am also curious as to whether his comparison with QS also considers the time to do the final square root along with the sieve time? He reported that for 2,488+, the final square root took about 15% of the total sieve time. [1 day vs. 6 days] -- Bob Silverman These are my opinions and not MITRE's. Mitre Corporation, Bedford, MA 01730 "You can lead a horse's ass to knowledge, but you can't make him think"
Technical Details
Message-ID:
<1992Aug22.113206.4385@linus.mitre.org>Path:
arc1-ca.pugleaf.net!sparky!uunet!usc!sdd.hp.com!uakari.primate.wisc.edu!ames!agate!linus!linus.mitre.org!gauss!bsReferences:
<9208220157.AA02629@ucbvax.Berkeley.EDU> <8146.Aug2205.17.2492@virtualnews.nyu.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!sdd.hp.com!uakari.primate.wisc.edu!ames!agate!linus!linus.mitre.org!gauss!bs From: bs@gauss.mitre.org (Robert D. Silverman) Newsgroups: sci.crypt Subject: Re: RSA-129 contest Message-ID: <1992Aug22.113206.4385@linus.mitre.org> Date: 22 Aug 92 11:32:06 GMT References: <9208220157.AA02629@ucbvax.Berkeley.EDU> <8146.Aug2205.17.2492@virtualnews.nyu.edu> Sender: news@linus.mitre.org (News Service) Organization: Research Computer Facility, MITRE Corporation, Bedford, MA Lines: 44 Nntp-Posting-Host: gauss.mitre.org