ONE attest Student Number_ ICS 6D—Dillencourt Quiz #4 February 25, 2015 The quiz consists of two pages, plus the cover page. There are five problems. Fill in the cover page, and write your name and student number on each page of the quiz. Answer each part of each problem in the appropriate space. Only work within the appropriate space will be graded. Your answers should be clear, concise, and correct. Make sure we can find your answer. NO CALCULATORS! In questions 2, 3, and 4, you do not need to give a final mumerical answer. You can, and should, leave your solution as a mathematical expression with involving quantities such as P(n, k), C(n,k), (j), !, and k". In class and in the text, we discussed the RSA encryption system. As a reminder, it works as follows. Bob picks two primes, p and q. ‘The chosen primes should be large to make the encryption /decryption secure. He computes N = p-q and ¢ = (p—1)(q~1). He finds an integer e such that ged(e,¢) = 1. He computes an integer d such that e-d mod = 1. His public key, which he publishes, is the pair (N, e). His private key is the pair (9,4). A message m intended for Bob can then be encrypted using the formula c= m* mod N. ‘When Bob receives an encrypted message, he decrypts it using the formula m = c# mod N. 1, Suppose that Bob picks two primes that result in his public key being the pair (35,5). Show that this is an insecure choice by answering the following questions: (a) What are p and q? (Assume p < q.) raaey (b) What is ¢? $4) > [24] (c) What is d? es Lae -(14- «sy) B.S mand 24 =1 a) + sts-24 94-465) as (as J 2. A grocery store offers a promotion in which six customers visiting the store on a particular day are each given a gift. No customer can receive more than one gift. 240 customers enter the store on the day of the promotional. (a) If the gifts are all identical, how many different ways are there to distribute the gifts? 40 Cry | (b) If the gifts are all different from each other, how many different: ways are there to distribute the gifts? \ R(240) ©»