Re: RSA cracked? I don't think so..., HUGE primes?

Article View: sci.crypt

Article #2704

#2704

From: Graham Toal
Date: Thu, 21 Jan 1993 11:35

8 lines
804 bytes

In article <1993Jan21.070521.9787@netcom.com> rcain@netcom.com (Robert Cain) writes:
:I'll be corrected if not :-)  The probibalistic test can be iterated
:for an arbitrarilarily high theoretical probability that one is prime.
:Well, I know that one is prime, you understand what I mean. :-)

"Oh no it isn't!" :-)

G

Technical Details

Message-ID: <C17C7G.AJF@demon.co.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!pipex!demon!gtoal

References: <1993Jan20.231041.4691@zip.eecs.umich.edu> <1993Jan21.070521.9787@netcom.com>

Show Full Headers

Complete Article Headers

Newsgroups: sci.crypt,sci.math
Path: arc1-ca.pugleaf.net!sparky!uunet!pipex!demon!gtoal
From: gtoal@pizzabox.demon.co.uk (Graham Toal)
Subject: Re: RSA cracked? I don't think so..., HUGE primes?
Message-ID: <C17C7G.AJF@demon.co.uk>
Sender: news@demon.co.uk
Nntp-Posting-Host: pizzabox.demon.co.uk
Organization: Cuddlehogs Anonymous
References: <1993Jan20.231041.4691@zip.eecs.umich.edu> <1993Jan21.070521.9787@netcom.com>
Distribution: na
Date: Thu, 21 Jan 1993 11:35:39 GMT
Lines: 8

Reply to Parent Message