hw7 - 1. Two users, Alice and Bob, use public keys to...

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

View Full Document Right Arrow Icon
1 1. Two users, Alice and Bob, use public keys to communicate. The two public keys are: Pa+: Alice public key (n, d)=(33,7) Pa-: Alice private key (n, e)=(33,3) Pb+: Bob’s public key (33, 13) Pb-: Bob’s private key (33, 17) Assume each of the 26 letters is represented by 5 bits, as shown below: a: 00001 b: 00010 c: 00011 z: 11010 Alice sends the following message “help” to Bob. (a) Suppose we use CRC to generate the message digest. The generator is x 5 + x 3 + x + 1 Compute the digital signature of the message (b) Encrypt the entire message (message + signature) using Bob’s public key. Write down the entire binary stream. Since the remainder of 33 may be 32. Thus we need to use 6 bits to represent each encrypted letter (including the CRC). (c) When the message is received, decrypt the message using Bob’s private key. Show your procedure. 2 . In RSA, we select e and d such that ed = 1 mod z , where z = (p-1)(q-1). The first step in solving this problem is to select an e that is relatively prime to
Background image of page 1

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

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

This note was uploaded on 10/16/2011 for the course ELEC 308,315,10 taught by Professor Prof.shenghuisong during the Spring '11 term at CUHK.

Page1 / 3

hw7 - 1. Two users, Alice and Bob, use public keys to...

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

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