home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!paladin.american.edu!darwin.sura.net!sgiblab!munnari.oz.au!cs.mu.OZ.AU!aet
- From: aet@mullian.ee.mu.OZ.AU (bert thompson)
- Subject: Re: HELP on RSA scheme for Encryption/Decryption
- Message-ID: <aet.721885629@munagin>
- Sender: news@cs.mu.OZ.AU
- Organization: Computer Science, University of Melbourne, Australia
- References: <6605@dciem.dciem.dnd.ca>
- Distribution: na
- Date: Mon, 16 Nov 1992 03:47:09 GMT
- Lines: 46
-
- jorchard@dciem.dciem.dnd.ca (Jeff Orchard) writes:
-
- >I would like to know the algorithm for encrypting/decrypting codes
- >with the RSA scheme. I took it in first year algebra, but I sold my
- >textbook and can't remember for the life of me how it went.
-
- >Could someone out there with better resources (or better memory)
- >help me?
-
- --------------------------------------------------------------------------------
-
- RSA in 30 seconds:
-
- choose two big primes p q such that p /= q
- let n = p * q
-
- also choose random e such that e < phi_n and e and phi_n are coprime
- where
- phi_n = phi n = (p-1)*(q-1) since p and q are prime.
-
- (phi is the euler phi function)
-
-
- then encode message (a number):
-
- m -> m^e (mod n)
-
- decode message:
-
- c -> c^d (mod n)
- where
- d = inverse e (mod phi_n)
- (i.e. d*e = 1 (mod phi_n))
-
- --------------------------------------------------------------------------------
-
- well that's the idea essentially. but you also have to write the algorithms
- for finding inverses, powers, big primes etc.
-
- bert.
-
- --------------------------------------------------------------------------------
- bert thompson aet@munagin.ee.mu.oz.au.
- SITEE school of information technology and electrical engineering
- university of melbourne
- --------------------------------------------------------------------------------
-