Article View: sci.crypt
Article #469Re: tabulation of primes
From: Sam Blackburn
Date: Tue, 11 Aug 1992 03:11
Date: Tue, 11 Aug 1992 03:11
13 lines
1049 bytes
1049 bytes
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 In my humble excursions into this arena, I've noticed that primes are roughly 11% of the numbers of x digits in length. Is it feasible to compile a table of primes? Sure. But it's gonna be one heck of a list. The number of primes is not infinite (I'm probably going to get flamed on that remark).
Technical Details
Message-ID:
<1557@anagld.analytics.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!dtix!mimsy!anagld!sammyReferences:
<9208101729.AA24006@gandalf.ssw.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!dtix!mimsy!anagld!sammy From: sammy@anagld.analytics.com (Sam Blackburn) Newsgroups: sci.crypt Subject: Re: tabulation of primes Message-ID: <1557@anagld.analytics.com> Date: 11 Aug 92 03:11:00 GMT References: <9208101729.AA24006@gandalf.ssw.com> Organization: Computer Sciences Corporation - Systems Engineering Division Lines: 13