Article View: sci.crypt
Article #1891Re: Where is the FAQ - new reader
From: Bruce Schneier
Date: Wed, 18 Nov 1992 21:15
Date: Wed, 18 Nov 1992 21:15
8 lines
775 bytes
775 bytes
In article <1992Nov18.183729.16527@mlb.semi.harris.com> dbrillha@dave.mis.semi.harris.com writes: >Two quick questions from a new reader (and new to encryption) ... > as 1014^613 mod 1147 = 385. Can you point me to a fast numerical > algorithm for performing this type of computartion. > All knowledge can be found in Knuth. Bruce
Technical Details
Message-ID:
<BxxKEp.1L7@chinet.chi.il.us>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!linac!uchinews!machine!chinet!schneierReferences:
<1992Nov18.183729.16527@mlb.semi.harris.com>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!linac!uchinews!machine!chinet!schneier From: schneier@chinet.chi.il.us (Bruce Schneier) Subject: Re: Where is the FAQ - new reader Message-ID: <BxxKEp.1L7@chinet.chi.il.us> Keywords: FAQ RSA PRIMES Organization: Chinet - Public Access UNIX References: <1992Nov18.183729.16527@mlb.semi.harris.com> Date: Wed, 18 Nov 1992 21:15:59 GMT Lines: 9