Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!pitt!willett!ForthNet
From: ForthNet@willett.pgh.pa.us (ForthNet articles from GEnie)
Newsgroups: comp.lang.forth
Subject: public key encryption
Message-ID: <2560.UUL1.3#5129@willett.pgh.pa.us>
Date: 30 Mar 91 03:12:35 GMT
Organization: (n.) to be organized.  But that's not important right now.
Lines: 19

Category 1,  Topic 15
Message 1         Thu Mar 28, 1991
A.HALEY1 [aph]               at 14:10 EST
 
In Forth Dimensions, Volume XXII no. 6, there's a comment about the Northern
California Forth day:

"Alfred [Tang] described a unique method to reduce the computatinal load of
raising a big number to a very high power, and taking the mod of the product. 
This method [is useful for] the RSA [encryption] algorithm. The math is fully
disclosed." Now, this sounds very useful.  Does anybody out there know about
this?

Cheers, Andy.
-----
This message came from GEnie via willett.  You *cannot* reply to the author
using e-mail.  Please post a follow-up article, or use any instructions
the author may have included (USMail addresses, telephone #, etc.).
Report problems to: dwp@willett.pgh.pa.us _or_ uunet!willett!dwp