Article View: sci.crypt
Article #3380Re: Security of RSA and factoring
From: srt
Date: Mon, 02 Feb 1987 21:33
Date: Mon, 02 Feb 1987 21:33
18 lines
1307 bytes
1307 bytes
In article <348@bms-at.UUCP>, stuart@bms-at.UUCP (Stuart D. Gathman) writes:
> What do they teach in the schools these days?
>
> You can't test with certainty, but you can test with any desired
> level of confidence quite efficiently (i.e. you can't tell whether the
> algorithm or the hardware failed).
> --
> Stuart D. Gathman <..!seismo!dgis!bms-at!stuart>
AARRGGHH!!! How many times does it have to be said? You *CAN* test a number
for primality with certainty. Atkins has implemented Shafi Goldwasser's
algorithm and it routinely *PROVES* (yes PROVES) primality of numbers up
to 400 digits or so.....
--
Steve Tate UUCP: ..!{ihnp4,decvax}!duke!srt
CSNET: srt@duke
ARPA: srt%duke@csnet-relay
Technical Details
Message-ID:
<9144@duke.duke.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!sri-spam!mordor!lll-lcc!ames!ucbcad!ucbvax!decvax!mcnc!duke!srtReferences:
<9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <348@bms-at.UUCP>Show Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!sri-spam!mordor!lll-lcc!ames!ucbcad!ucbvax!decvax!mcnc!duke!srt From: srt@duke.UUCP Newsgroups: sci.crypt Subject: Re: Security of RSA and factoring Message-ID: <9144@duke.duke.UUCP> Date: Mon, 2-Feb-87 16:33:34 EST Article-I.D.: duke.9144 Posted: Mon Feb 2 16:33:34 1987 Date-Received: Wed, 4-Feb-87 03:40:51 EST References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <348@bms-at.UUCP> Organization: Duke University CS Dept.; Durham, NC Lines: 18