HW1

(due Oct. 6)

1. 5.(20pt) Alices RSA public key is (N,e)=(33,3) and her private key is d =7.
(a) If Bob encrypts the message M = 19 for Alice, what is the ciphertext C? Show that Alice can decrypt C to
obtain M.

C M e mod N 193 mod 33 28

M C d mod N 287 mod 33 19
(b) Let S be the result when Alice digitally signs the message M = 25. What is S? If Bob receives M and S,
explain the process Bob will use to verify the signature. Show that in this case the signature verification
succeeds.

S 253 mod 33 16
Public key : (N, e) = (33, 3)
S = 16, M = 25
- d : ed = 1 mod (p-1)(q-1) = 1 mod 20, d = 7
- M S d mod N 167 mod 33 25
-
2. Recall the online bid method discussed in the class.
a. What properties of the secure hash function h does this scheme rely on to prevent cheating?
Hashes Self submit
Hashes Open bid not (one way), Hashes (collision) After
submitting a bid change
b. Suppose that Charlie is certain that Alice and Bob will both submit bids between $10.000 and $20,000.
Describe an attack that Charlie can use to determine Alices bid and Bobs bid from their respective hash values.
How can the bidding procedure be modified to prevent this attack?
- If the number of 10,000 different Hash
. Do you know how to check, so it is possible to be interpreted as a
simple iteration
- HMAC hash .
3. Suppose BoB and Alice want to flip a coin over a network. Alice proposes the following procedure:
(i) Alice selects a value X {0,1}.
(ii) Alice generates a 256-bit random symmetric key K.

(iii) Using AES, Alice computes Y = E(X, R, K), where R consists of 255 random bits.
(iV) Alice sends Y to Bob.
(V) Bob guesses a value Z {0,1} and tells Alice.
(Vi) Alice gives the key K to Bob who computes (X,R) = D(Y,K)
(Vii) If X=Z then Bob wins; otherwise Alice wins.
Explain how Alice can cheat. Using a hash function, modify this protocol so that Alice can cheat.
* Alice Bob , key K Bob , Alice .
Alice is Bob's key, then I know K results to Bob by offering, can manipulate the results
of Alice
* Hash Function use
- self-select results ( select X{0, 1})
- Random value select (select Ra)
- Hash (send hash{X, Ra})
- X, Ra send