Solved by an expert
Assume that a and b share a long-term 256-bit aes key k. our key exchange protocol
Assume that a and b share a long-term 256-bit aes key k. our key exchange protocol has two goals: (1) let a and b agree on a new fresh session key k, to be used for a current session, and (2) perform mutual authentication. n, is a nonce and k, is a new session key generated by b. assume that k and nb are of the same bit-length and both are always chosen at random. ex( ) denotes aes encryption of everything inside ) with key k. hmack denotes sha2-based hmac of everything inside ) using key h protocol: 1. a -> b: ek(a, b, "hello") 2. b -> a: ek(ks, nb, hmack (a,b, "hello"))3. a -> b: hmack(ks,nb,1)what (if any) are the vulnerabilities of this protocol? and, how can you fix them? again, keep your answers limited to 8-10 lines.
Show Answers
14. A mesh represents a(n) object if its faces enclose a positive and finite amount of space. (1 point)
odd
connected
simple
convex
15. Which of the following is the 3-D view port? (1 point)
the standard layout used for new files
the polygon viewing on the default screen
straight line segments connecting two vertices
a single static image in 3-D
The answer for number 1, should be:
SOLID
A mesh represents a solid object if its faces enclose a positive and finite amount of space
The answer for the second question is:
a single static image in 3-D