The RSA Algorithim In A Page
Help - Help for Webmasters« back to results for ""Below is a cache of http://www.colug.net/notes/0009mtg/rsa-iap.pdf. It's a snapshot of the page taken as our search engine crawled the Web.
The web site itself may have changed. You can check the current page or check for previous versions at the Internet Archive.Yahoo! is not affiliated with the authors of this page or responsible for its content.The RSA Algorithim In A PageThe RSA Algorithim In A PageJacob Hopkinsjacob@teched.netSeptember 27, 2000AbstractA one page overview of the RSA algorithm focusing
on easily understood equations and managable num-
bers.1The AlgorithmFrom Applied Cryptography, Second Edition:n = pqed 1 mod (p 1)(q 1)c = memod nm = cdmod nn is the product of p and q, two prime numbers.The product of e and d divided by (p 1)(q 1) hasa remainder of 1. c is the remainder of medividedby n. m is the remainder of cddivided by n.2The Product of Two Primesn is the product of two prime numbers, p and q. n
is made public as it is used in decryption as well as
encryption. p and q should never be revealed.
Example:p = 59, q = 67; n = 59
refer page:-------http://www.officesoon.com/doc/99720-the-rsa-algorithim-in-a-page
Click Here To Download...