# 代写代考 # of participants: 85 / 100 average: 7.344 / 10 – cscodehelp代写

# of participants: 85 / 100 average: 7.344 / 10
47 students got A+
Quiz 7 – statistics
38 students

7.5*1.2 = 9.0

Assume we are designing a payroll server in a system of N users/employees.
We would like the server to be able to send confidential updates to each of the N employees about their monthly earnings. No other messages in this system need to be protected (i.e., encrypted). The actual distribution of keys (either symmetric or asymmetric) is also not an issue in this system.
Which of the following do you agree with, when it comes to the design of the given payroll server?
1) The server should deploy asymmetric encryption, as that would reduce the overall number of keys that the server needs to have and use compared to symmetric encryption.
2) The asymmetric encryption does not provide any advantage in terms of the number of keys used by the server, yet it is slower. So, symmetric encryption is the way to go.
Symmetric encryption:
To send confidential message to all N users, the server has to have a unique symmetric key for each user. N keys in total!
Asymmetric encryption:
To send confidential message to all N users, the server has to have the public key of/for each of the N users. N keys in total!

Consider an asymmetric encryption system with N users, including Alice and Bob.
Alice and Bob have provided everybody else with their respective public keys (KA-public and KB-public), while keeping their private keys for themselves (KA-private and KB-private).
Now, Alice wants to send a confidential message M to Bob, while at the same time enabling Bob to verify that the message was sent by her/Alice (and not someone else pretending to be Alice).
How should Alice encrypt such a message?
Alice does not have this key!
1) First encrypt M with and then with KA-private – i.e., Alice sends KA-private(KB-private(M)) 2) First encrypt M with and then with KA-public – i.e., Alice sends KA-public(KB-private(M))
Bob cannot decrypt this!
3) First encrypt M with KB-public and then with KA-public – i.e., Alice sends KA-public(KB-public(M))
KB-private KB-private
4) First encrypt M with KB-public and then with KA-private – i.e., Alice sends KA-private(KB-public(M))

Alice and Bob are trying to establish a new symmetric encryption key using the Diffie-Hellman algorithm/procedure as discussed in class. They adopt the following values for p and g: p=9 and g=2.
Alice¡¯s chooses her private key to be KA-private = 2, and Bob chooses his private key to be KB-private = 3. What will their new symmetric key be, once they go through the entire Diffie-Hellman procedure?
2) 2 3) 4 4) 8
KA-public= 22 mod 9 = 4
K=(KA-public) B-private mod9=43 mod9=64mod9=1

Alice and Bob are trying to establish a new symmetric encryption key using the Diffie-Hellman algorithm/procedure as discussed in class. They adopt the following values for p and g: p=9 and g=2.
Trudy knows the values of p and g, and she also manages to capture Alice¡¯s public key: Given these assumptions, which of the following is correct?
KA-public = 4.
1) Trudy concludes that Alice¡¯s private key must be KA-private = 2.
2) Trudy concludes that Alice¡¯s private key must be KA-private = 4.
3) Trudy concludes that Alice¡¯s private key must be KA-private = 6.