http://wiki.cas.mcmaster.ca/index.php?feed=atom&target=Holtzmt&title=Special%3AContributions 2026-04-11T19:14:18Z From Computing and Software Wiki MediaWiki 1.15.1 http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:53:34Z

<p>Holtzmt:&#32;/* See Also */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. Compute d such that 3*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. Public Key is (k,e), Private Key is (k,d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = ((m^e)mod k)'' . Assume a message m=22 cipher text ''c = ((m^e)mod k) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod k)''. Decrypted message m’ = ((40^11) mod 51) = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Encryption_Algorithms<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Authentication<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Steganography_and_Digital_Watermarking<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Data_Encryption_for_Storage_Devices<br /> --[[User:Holtzmt|Holtzmt]] 14:53, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:48:22Z

<p>Holtzmt:&#32;/* Example */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. Compute d such that 3*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. Public Key is (k,e), Private Key is (k,d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = ((m^e)mod k)'' . Assume a message m=22 cipher text ''c = ((m^e)mod k) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod k)''. Decrypted message m’ = ((40^11) mod 51) = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Encryption_Algorithms<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Authentication<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Steganography_and_Digital_Watermarking<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Data_Encryption_for_Storage_Devices<br /> <br /> --[[User:Holtzmt|Holtzmt]] 14:46, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:47:38Z

<p>Holtzmt:&#32;/* Example */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. Compute d such that 3*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. Public Key is (k,e), Private Key is (k,d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e(mod k)'' . Assume a message m=22 cipher text ''c = ((m^e)mod k) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod k)''. Decrypted message m’ = 40^11 mod 51 = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Encryption_Algorithms<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Authentication<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Steganography_and_Digital_Watermarking<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Data_Encryption_for_Storage_Devices<br /> <br /> --[[User:Holtzmt|Holtzmt]] 14:46, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:46:06Z

<p>Holtzmt:&#32;/* See Also */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. Compute d such that 5*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. Public Key is (T(k),e), Private Key is (T(k),d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e(mod T(k)))'' . Assume a message m=22 cipher text ''c = ((m^e)mod T(k)) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod T(k))''. Decrypted message m’ = 40^11 mod 51 = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Encryption_Algorithms<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Public_Key_Authentication<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Steganography_and_Digital_Watermarking<br /> *http://www.cas.mcmaster.ca/wiki/index.php/Data_Encryption_for_Storage_Devices<br /> <br /> --[[User:Holtzmt|Holtzmt]] 14:46, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:40:09Z

<p>Holtzmt:&#32;/* Example */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. Compute d such that 5*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. Public Key is (T(k),e), Private Key is (T(k),d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e(mod T(k)))'' . Assume a message m=22 cipher text ''c = ((m^e)mod T(k)) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod T(k))''. Decrypted message m’ = 40^11 mod 51 = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> --[[User:Holtzmt|Holtzmt]] 13:16, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:38:51Z

<p>Holtzmt:&#32;/* Example */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. compute d such that 5*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. public key is (T(k),e), private key is (T(k),d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e(mod k))'' . Assume a message m=22 cipher text ''c = ((m^e)mod k) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod k)''. Decrypted message m’ = 40^11 mod 51 = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> --[[User:Holtzmt|Holtzmt]] 13:16, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:38:35Z

<p>Holtzmt:&#32;/* Example */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij, k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1), T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. compute d such that 5*d = 1 mod 32, d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. public key is (T(k),e), private key is (T(k),d), Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e)(mod k)'' . Assume a message m=22 cipher text ''c = ((m^e)mod k) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod k)''. Decrypted message m’ = 40^11 mod 51 = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> --[[User:Holtzmt|Holtzmt]] 13:16, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:37:37Z

<p>Holtzmt:&#32;/* Example */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=17, j=3<br /> <br /> 2. compute k=ij<br /> <br /> k = 17*3 = 51<br /> <br /> 3. compute T(k)=(i-1)*(j-1)<br /> <br /> T(k) = (17-1)*(3-1) = 10*4 = 32<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. compute d such that 5*d = 1 mod 32<br /> <br /> d = 11 such that 3*11 = 1 mod 32<br /> <br /> 6. public key is (T(k),e), private key is (T(k),d) <br /> <br /> Public Key = (51, 3), Private Key = (51, 11) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e)(mod k)'' <br /> <br /> Assume a message m=22 cipher text ''c = ((m^e)mod k) = 22^3 mod 51 = 10648 mod 51 = 40 ''<br /> <br /> 8. Decrypt cipher text using Private Key with ''m' = ((c^d) mod k)'' <br /> <br /> Decrypted message m’ = 40^11 mod 51 = 22<br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> --[[User:Holtzmt|Holtzmt]] 13:16, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T18:23:01Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 1''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> ==Example==<br /> <br /> 1. choose 2 prime numbers. For examples sake i=11, j=5<br /> <br /> 2. compute k=ij<br /> <br /> k = 11*5 = 55<br /> <br /> 3. compute T(k)=(i-1)*(j-1)<br /> <br /> T(k) = (11-1)*(5-1) = 10*4 = 40 <br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. <br /> <br /> Choose ''e'' = 3<br /> <br /> 5. compute d such that 3*d = 1 mod 40<br /> <br /> d = 13 such that 3*13 = 1 mod 40 <br /> <br /> 6. public key is (k,e), private key is (k,d) <br /> <br /> Private Key = (50, 3), SK= (50, 13) <br /> <br /> 7. Encrypt message using Private Key with ''c = (m^e)(mod k)'' <br /> <br /> Assume a message M=10 cipher text ''''c = (m^e)(mod k)'' = 10^3 mod 50 = 100 mod 33 =13 <br /> <br /> 8. Decrypt cipher text using SK with M' = C^D mod N: <br /> <br /> Decrypted message M’ = C^D mod N = 13^7 mod 33 = 7 <br /> <br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> --[[User:Holtzmt|Holtzmt]] 13:16, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T17:16:14Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html<br /> --[[User:Holtzmt|Holtzmt]] 13:16, 12 April 2009 (EDT)</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T17:15:40Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography<br /> <br /> ==See Also==<br /> *http://imps.mcmaster.ca/courses/SE-4C03-09/project/wiki-pages.html</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T17:13:09Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> <br /> ==External Links==<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T17:12:13Z

<p>Holtzmt:&#32;/* References */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pp.881–887<br /> *http://en.wikipedia.org/wiki/RSA<br /> *http://en.wikipedia.org/wiki/Public-key_cryptography</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T17:07:18Z

<p>Holtzmt:&#32;/* History */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> The algorithm was first publicized in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman. The three worked at MIT at the time. RSA stands for Rivest, Shamir, and Adleman.<br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pages = pp.881–887</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T16:59:46Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.<br /> <br /> ==History==<br /> <br /> <br /> <br /> ==References==<br /> * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ''Introduction to Algorithms'', 2nd Edition, MIT Press and McGraw-Hill, 2001, isbn 0-262-03293-7, pages = pp.881–887</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T16:45:58Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> The two keys are a tuple. The public key consists of the Public Key Exponent, and the Modulous, (e,k). The Private Key consists of the Private Key Exponent, and again, the Modulous, (d,k).<br /> <br /> <br /> ===Encryption===<br /> Person A wants to send a message to Person B. Person B requests person A's Public key, (e,k)<br /> <br /> The message to be sent is then turned into a number, ''m'', an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> Person B wants to decrypt a message send from Person A. Person B uses their own private key (d,k) to decrypt the message in the following way. m = (c^d)(mod k)<br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T16:11:13Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> <br /> ===Encryption===<br /> <br /> Encryption is accomplished by first turning the message, ''m'' into an integer between ''0'' and ''k''. The encrypted ''c'' message can then be calculated by ''c = (m^e)(mod k)''<br /> <br /> <br /> ===Decryption===<br /> <br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T16:04:31Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing. Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> <br /> ===Encryption===<br /> <br /> <br /> <br /> ==Digital Signing==<br /> <br /> Messages encrypted with with your Public Key can only be decrypted with your own private key. Conversly, messages encrypted with your own Private Key, can only be decrypted with your public key. Thus, Digital Signing is accomplished in the following way.<br /> <br /> Person B wishes to send an encrypted message to Person A<br /> <br /> 1. The two parties exchange public keys.<br /> <br /> 2. Person B Encrypts the message with their own Private Key.<br /> <br /> 3. Person B then Encrypts the message again with Person A's Public Key, and sends the message to Person A.<br /> <br /> 4. Person A recieves the message, and decrypts it once with their own private key, and then again with Person <br /> B's Public Key. <br /> <br /> <br /> Since the message was encrypted with Person A's public key, only Person A can decrypt the message with their private key. Since the message was also decrypted with Person B's public key, Person A also knows that the message must have been encrypted with Person B's Public key verifying the source of the message.</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T15:53:07Z

<p>Holtzmt:&#32;/* Algorithm */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.<br /> <br /> <br /> ===Encryption===</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-12T15:48:15Z

<p>Holtzmt:&#32;/* Key Generation */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer ''e'' such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. ''e'' is the Public Key Exponent.<br /> <br /> 5. Compute ''d'' such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''. ''d'' is the Private Key Exponent.</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-10T19:24:04Z

<p>Holtzmt:&#32;/* Key Generation */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of ''k''. ''T(k) = (i-1)(j-1)''<br /> <br /> 4. Choose an integer e such that ''1 &lt; e &lt; T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. e is the public key.<br /> <br /> 5. Compute d such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0''</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-10T19:01:56Z

<p>Holtzmt:&#32;/* Key Generation */</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> 3. Compute the Totient of k. T(k) = (i-1)(j-1)<br /> <br /> 4. Choose an integer e such that 1 &lt; e &lt; T(k), and e and T(k) are [http://en.wikipedia.org/wiki/Coprime coprime].</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-10T18:30:17Z

<p>Holtzmt:&#32;</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.<br /> <br /> <br /> ==Algorithm==<br /> The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.<br /> ===Key Generation===<br /> RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.<br /> <br /> 1. Two suitably large different prime numbers are randomly generated, ''i'', ''j''.<br /> <br /> 2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys.<br /> ''k = ij''<br /> <br /> &lt;math&gt;\varphi(k) = (i-1)(j-1)\&lt;/math&gt;</div>

Holtzmt http://wiki.cas.mcmaster.ca/index.php/RSA_Encryption_Algorithm 2009-04-10T17:38:54Z

<p>Holtzmt:&#32;New page: The RSA Encryption Algorithm is a form of encryption used in Public Key Encryption Algorithms. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It ...</p> <hr /> <div>The RSA Encryption Algorithm is a form of encryption used in [[Public Key Encryption Algorithms]]. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.</div>

Holtzmt