Article View: sci.crypt
Article #465Re: tabulation of primes
From: Robert D. Silverman
Date: Mon, 10 Aug 1992 18:29
Date: Mon, 10 Aug 1992 18:29
24 lines
1545 bytes
1545 bytes
In article <9208101729.AA24006@gandalf.ssw.com> rjl@GANDALF.SSW.COM (Robert J Leone) writes: :In an encyclopedia reference on RSA, it mentioned using values around 10**75 :for p and q. One question (and please excuse my possible mathematical :naivete): : Does anyone here have a feel for how sparse primes are in the range :10**75 to 10**76? In other words, is it computationally feasible to :compile a table of primes You last sentence was left incomplete. If you are asking whether one could compile all the 75 digit primes, the answer is: not in the lifetime of this universe. Near 75 digits approximately 1 in every 172.7 integers is prime, so there are approximately 5.79 x 10^72 75-digit primes. If you want to compile a table of *some* 75 digit primes, then the answer to your question is yes. Finding and proving 75-digit primes is trivial. -- 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:
<1992Aug10.182955.12837@linus.mitre.org>Path:
arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!sun-barr!ames!agate!linus!linus.mitre.org!gauss!bsReferences:
<9208101729.AA24006@gandalf.ssw.com>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!sun-barr!ames!agate!linus!linus.mitre.org!gauss!bs From: bs@gauss.mitre.org (Robert D. Silverman) Subject: Re: tabulation of primes Message-ID: <1992Aug10.182955.12837@linus.mitre.org> Sender: news@linus.mitre.org (News Service) Nntp-Posting-Host: gauss.mitre.org Organization: Research Computer Facility, MITRE Corporation, Bedford, MA References: <9208101729.AA24006@gandalf.ssw.com> Date: Mon, 10 Aug 1992 18:29:55 GMT Lines: 24