This problem performs elliptic curve encryption/decryption using the scheme out-
lined in section 10.4. the cryptosystem parameters are e11(1,6) and g = (2,7). b's
secret key is nb = 3. (hint: note the relationship of this system to the one discussed in
the previous question (10.14)]

a. find b's public key pb.
b. a wishes to encrypt the message pm = (10,9) and chooses the random value
k = 4. determine the ciphertext cm.

c. show the calculation by which в recovers pm from cm.

(10.> for e11(1,6) consider the point g=(2,7). compute the multiple of g from 2g through 13g.)

Assignment: permutations use the permutation formula   r ! ! n n p nr   to solve each problem. be sure to show all work leading to your answer. part i: solve real-world permutation problems choose any four (4) of the following five problems to solve. for each problem a) show how the permutation formula can be used to find the answer and b) write a sentence to explain the meaning of the answer for the situation. 1. to register for online banking services at a local credit union, you need to select a four-digit personal identification number, or pin code. the digits cannot be repeated. how many ways are there to arrange four digits out of the numerals 0 through 9 to create a code?