This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: MATH 135 Fall 2008 Assignment #9 Due: Wednesday 26 November 2008, 8:20 a.m. N.B. This is the final regularly scheduled Assignment. There will be an Assignment X created and solutions posted. While you should not hand Assignment X in, working through the problems will be helpful in learning the material from Chapter 8. Notes : In Problem 1, please do your work by hand and show this work. (Of course, using MAPLE to check your answers is probably a good idea.) The last page of this document contains some handy MAPLE commands. The text file Problem 3 Values contains the values of the large numbers in Problem 3 in text format. Hand-In Problems 1. (a) In an RSA scheme, the public key ( e, n ) = (21 , 12193) and the private key is ( d, n ) = (6269 , 12193). Using the Square and Multiply algorithm, encrypt the message M = 2762 using the appropriate key. (b) In an RSA scheme, the the public key is ( e, n ) = (827 , 1147), the private key is ( d, n ) = (871 , 1147). Note that 31 is a factor of 1147. Using the Chinese Remainder Theorem, decrypt the ciphertext C = 765 using the appropriate key. 2. Complete the following steps using MAPLE: Using the command restart , clear MAPLEs memory....
View Full Document