CAUsersmichalOneDriveDocumentslwinter 2018 comp 367 Mast332-Winter2018-Assignment5.m- Server 11] - Maple 2017 File Edit View Insert Format Table Drawing Plot Tools Window Help Alt+S Mast332-Winter 2018-Assignment5.mw Math Drawing Plot Animation Hide P Heading 1 Seri 17387 and g 3623 and finds the modulus m -62993 101 : Then he choses the encoding exponent e 19 Peter wants to set up RSA system to get secure coded messages romAlice. He chooses to primes for Alice, and calculates for this e the decoding exponent d. Peter keeps d for himself and sends e and mto Alice. p) Alice wants to send the atext T to Peter. She converts the text Tinto a sequence of double-digit numbers from 01 to 27 for letters from A to Z using 27-character conversion table A" B"C" "D E "F" G" "H I 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 the number 27 (00) for space, to get the numeric word W. Because Whappens to be smaller than the 8-digit modulus m, she needs only one word text w (anumber), so Alice calculates the encrypted word c-w mod m, and sends it to Peter c#-10123267; Decode the text sent by Alice. To do so, repeat the calculations done by Peter: (a) Use the Euler's Theorem in the ring Z/Z in order to find the decoding exponent d as the inverse ofe. (b) Perform decoding and recover the original text T that Alice has sent to Peter (you can use any 10123267 NOTE in order to make computation with large moduli possible, Peter reduces calculations oflarge powers modulo m to a system of Chinese remainder type modulo p and q as desribed in Lecture 8. Repeat his calculations Ready Maple Default Profile C:wsersymicheOneDrivepocumentshnter 2018'comp 367 Memory: 4.18M Time: 0.15s Zoom: 100% Text Mode ENG 617 PM O Type here to search ^??q)) US 2018-03-21 CAUsersmichalOneDriveDocumentslwinter 2018 comp 367 Mast332-Winter2018-Assignment5.m- Server 11] - Maple 2017 File Edit View Insert Format Table Drawing Plot Tools Window Help Alt+S Mast332-Winter 2018-Assignment5.mw Math Drawing Plot Animation Hide P Heading 1 Seri 17387 and g 3623 and finds the modulus m -62993 101 : Then he choses the encoding exponent e 19 Peter wants to set up RSA system to get secure coded messages romAlice. He chooses to primes for Alice, and calculates for this e the decoding exponent d. Peter keeps d for himself and sends e and mto Alice. p) Alice wants to send the atext T to Peter. She converts the text Tinto a sequence of double-digit numbers from 01 to 27 for letters from A to Z using 27-character conversion table A" B"C" "D E "F" G" "H I 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 the number 27 (00) for space, to get the numeric word W. Because Whappens to be smaller than the 8-digit modulus m, she needs only one word text w (anumber), so Alice calculates the encrypted word c-w mod m, and sends it to Peter c#-10123267; Decode the text sent by Alice. To do so, repeat the calculations done by Peter: (a) Use the Euler's Theorem in the ring Z/Z in order to find the decoding exponent d as the inverse ofe. (b) Perform decoding and recover the original text T that Alice has sent to Peter (you can use any 10123267 NOTE in order to make computation with large moduli possible, Peter reduces calculations oflarge powers modulo m to a system of Chinese remainder type modulo p and q as desribed in Lecture 8. Repeat his calculations Ready Maple Default Profile C:wsersymicheOneDrivepocumentshnter 2018'comp 367 Memory: 4.18M Time: 0.15s Zoom: 100% Text Mode ENG 617 PM O Type here to search ^??q)) US 2018-03-21