Where is the FAQ - new reader - Article 1870 - go-pugleaf

Article View: sci.crypt

Article #1870

Where is the FAQ - new reader

#1870

From: Dave Brillhart
Date: Wed, 18 Nov 1992 18:37

14 lines
1155 bytes

Two quick questions from a new reader (and new to encryption) ...

1.) Were can I get the most recent FAQ?

2.) I am playing around with understanding RSA. Pretty simple.
    (IMHO someone, someday, will find a fast way to factor huge primes)
    Anyway, the unencrypt step requires huge (x^y mod z) calculations.
    Testing using 2-digit prime numbers still leads to computations such
    as 1014^613 mod 1147 = 385. Can you point me to a fast numerical
    algorithm for performing this type of computartion.

Thanks,

-- Dave

Technical Details

Message-ID: <1992Nov18.183729.16527@mlb.semi.harris.com>

Path:

arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!darwin.sura.net!mlb.semi.harris.com!dave.mis.semi.harris.com!dbrillha

Show Full Headers

Complete Article Headers

Newsgroups: sci.crypt
Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!sgiblab!darwin.sura.net!mlb.semi.harris.com!dave.mis.semi.harris.com!dbrillha
From: dbrillha@dave.mis.semi.harris.com (Dave Brillhart)
Subject: Where is the FAQ - new reader
Date: Wed, 18 Nov 1992 18:37:29 GMT
Nntp-Posting-Host: dave.mis.semi.harris.com
X-Newsreader: TIN [version 1.1 PL6]
Reply-To: dbrillha@dave.mis.semi.harris.com
Organization: Harris Semiconductor
Keywords: FAQ RSA PRIMES
Sender: news@mlb.semi.harris.com
Summary: FAQ for a new reader
Message-ID: <1992Nov18.183729.16527@mlb.semi.harris.com>
Lines: 14