RSA_Algorithm_011208 - RSA Public and Private Keys q 6577 p...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: RSA Public and Private Keys q 6577 p 9293 2) Is the n = p * q 61120061 to φ Pub (Enciphering Key) 188240747 3) 'Pub * Priv (Deciphering Key) 32401283 4) 1 < Pu Plaintext 42456 4) 1 < Pr φ (n) = (p-1)*(q-1) 61104192 Pub * Priv mod φ =1 1) ISODD. The top bit is the least significant bit, the one on the left. 2) Columns D and E shows the RSA Algorithm. It raises a number to an exponent using its binar Modulo 61120061 Pub Key 188240747 Plaintext 42456 Enciphering Bit # Enciphering Key Binary Bit # 1 188240747 1 3465625 20588173 1 2 94120373 1 10735618 19102931 2 3 47060186 54909541 54909541 3 4 23530093 1 35778496 56070204 4 5 11765046 50238450 50238450 5 6 5882523 1 17888498 57313163 6 7 2941261 1 18655923 996389 7 8 1470630 53993990 53993990 8 9 735315 1 51389918 7541091 9 10 367657 1 4875123 25695542 10 11 183828 16987726 16987726 11 12 91914 38346477 38346477 12 13 45957 1 49580770 26270280 13 14 22978 29572181 29572181 14 15 11489 1 50838608 10107094 15 1) p and 3) Clear There are two algorithms here. One is to convert e to binary and the other one is to raise a nu Decimal to Binary (Columns B and C): In column C, if the number to the left is odd write a CRYPTO 4: RSA Algorithm (Encryption) Step 0: Given input , a sequence of bits for encryption Step 1 : Let o k k e e e e 1 1 ...- be the binary representation of the encryption k Step 2 : Set the variable C to 1 Step 3 : Repeat steps 3a and 3b for i = k, k - 1, k - 2, …..1, 0 Step 3a : Set C to the remainder of C 2 when divided by n (C 2 mo Step 3b : If e 1 = 1, then set C to the remainder of C . input when Step 4 : Stop C is the encrypted form of input . Calculate Private Key 16 5744 23489749 23489749 16 17 2872 49871156 49871156 17 18 1436 52400067 52400067 18 19 718 33092716 33092716 19 20 359 1 29947559 34055982 20 21 179 1 23272089 34024519 21 22 89 1 12212288 3421865 22 23 44 7280561 7280561 23 24 22 54938775 54938775 24 25 11 1 41385632 49998625 25 26 5 1 15608444 8397102 26 27 2 30030167 30030167 27 28 1 1 1 42456 28 29 1 1 29 30 1 1 30 31 1 1 31 32 1 1 32 33 1 1 33 34 1 1 34 35 1 1 35 36 1 1 36 37 1 1 37 38 1 1 38 39 1 1 39 40 1 1 40 41 1 1 41 42 1 1 42 43 1 1 43 44 1 1 44 45 1 1 45 46 1 1 46 47 1 1 47 48 1 1 48 49 1 1 49 50 1 1 50 51 1 1 51 52 1 1 52 53 1 1 53 54 1 1 54 55 1 1 55 56 1 1 56 57 1 1 57 58 1 1 58 59 1 1 59 60 1 1 60 61 1 1 61 62 1 1 62 63 1 1 63 64 1 1 64 65 1 1 65 66 1 1 66 67 1 1 67 68 1 1 68 69 1 1 69 70 1 1 70 71 1 1 71 72 1 1 72 73 1 1 73 74 1 1 74 75 1 1 75 76 1 1 76 77 1 1 77 78 1 1 78 79 1 1 79 80 1 1 80 81 1 1 81 82 1 1 82 83 1 1 83 84 1 1 84 85 1 1 85 86 1 1 86 87 1 1 87 88 1 1 88 89 1 1 89 90 1 1 90 91 1 1 91 92 1 1 92 93 1 1 93 94 1 1 94 95 1 1 95 96 1 1 96 97 1 1 97 98 1 1 98 99 1 1 99 100 1 1 100 101 1 1 101 102 1 1 102 103 1 1 103 104 1 1 104 105 1 1 105 106 1 1 106 107 1 1 107 108 1 1 108 109 1 1 109 110 1 1 110 111 1 1 111 112 1 1 112 113 1 1 113 114 1 1 114 115 1 1 115 116 1 1 116 117 1 1 117 118 1 1 118 119 1 1 119 120 1 1 120 121 1 1 121 122 1 1 122...
View Full Document

This note was uploaded on 06/20/2010 for the course TECH 6330 taught by Professor Obayo during the Spring '10 term at University of Arkansas for Medical Sciences.

Page1 / 193

RSA_Algorithm_011208 - RSA Public and Private Keys q 6577 p...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online