Article View: sci.crypt
Article #654RSA-129 contest
From: jbs
Date: Wed, 26 Aug 1992 02:00
Date: Wed, 26 Aug 1992 02:00
22 lines
1359 bytes
1359 bytes
Dan Bernstein posts:
:Instead he challenges me, saying, ``Dan, why don't you say what your
:estimates are?'' The answer is obvious: *I don't know*. I don't yet have
:reliable estimates, and until somebody factors a 130-digit general
:number, *nobody* will have reliable estimates.
and also:
:> Define 'wimpy' please for the rest of the audience.
:
:Under 100 digits.
Well if you actually had a complete GFNS implementation for
general numbers I believe you would obtain more reliable estimates by
performing a whole bunch of "wimpy" factorizations as opposed to a
single factorization of RSA-129.
You might also have a reliable figure of merit for what con-
stitutes a good polynomial representation. Extensive searches for
polynomials using different criteria than the ones you will eventually
use to select a polynomial (which you are encouraging people to per-
form) are a waste of computer time (since such searches are inherant-
ly inefficient).
James B. Shearer
Technical Details
Message-ID:
<9208260234.AA05450@ucbvax.Berkeley.EDU>Path:
arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!ucbvax!WATSON.IBM.COM!jbsShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!ucbvax!WATSON.IBM.COM!jbs From: jbs@WATSON.IBM.COM Newsgroups: sci.crypt Subject: RSA-129 contest Message-ID: <9208260234.AA05450@ucbvax.Berkeley.EDU> Date: 26 Aug 92 02:00:08 GMT Sender: daemon@ucbvax.BERKELEY.EDU Lines: 22