Re: Security of RSA and factoring

Article View: sci.crypt

Article #3376

#3376

From: stuart
Date: Wed, 21 Jan 1987 17:50

12 lines
1116 bytes

In article <615@mit-amt.MEDIA.MIT.EDU>, simsong@mit-amt.MEDIA.MIT.EDU (Simson L. Garfinkel) writes:

> WAIT! It is not "easy" to test a 100-digit number for priamity.
> How do you do that? To tell if a number is prime or not, you factor it.

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>

Technical Details

Message-ID: <348@bms-at.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!seismo!vrdxhq!bms-at!stuart

References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <615@mit-amt.MEDIA.MIT.EDU>

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!seismo!vrdxhq!bms-at!stuart
From: stuart@bms-at.UUCP
Newsgroups: sci.crypt
Subject: Re: Security of RSA and factoring
Message-ID: <348@bms-at.UUCP>
Date: Wed, 21-Jan-87 12:50:05 EST
Article-I.D.: bms-at.348
Posted: Wed Jan 21 12:50:05 1987
Date-Received: Sun, 1-Feb-87 16:05:48 EST
References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <615@mit-amt.MEDIA.MIT.EDU>
Organization: Business Management Systems, Inc., Fairfax, VA
Lines: 12
Summary: Read Knuth Volume 2

Reply to Parent Message