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.)

What is the algorithm for building a binary tree program

Write a method named addall that could be placed inside the hashintset class. this method accepts another hashintset as a parameter and adds all elements from that set into the current set, if they are not already present. for example, if a set s1 contains [1, 2, 3] and another set s2 contains [1, 7, 3, 9], the call of s1.addall(s2); would change s1 to store [1, 2, 3, 7, 9] in some order. you are allowed to call methods on your set and/or the other set. do not modify the set passed in. this method should run in o(n) time where n is the number of elements in the parameter set passed in.

Which of these is most responsible for differences between the twentieth century to the twenty-first century?