WRK6sol - PDF 3031
WRK6sol - PDF 3031
encryption? With link encryption each, each vulnerable communications link is equipped on both end with an encryption device. Traffic over all communications links is secured but a large number of devices are required. Traffic must also be decrypted at routers and switches to read the address header. With end-to-end, encryption is done at the two end systems. Data is encrypted and then transmitted unaltered across the network. Here, the traffic-pattern is exposed because packet headers are transmitted in the clear. (2) What is nonce. Explain its use in key agreement protocols. A nonce is a locally generated one-time challenge (pseudo-)random number or phrase. It is used as a countermeasure to certain attacks on key-exchange protocols (see page 206 of the text). Typical use: Initiator sends a nonce and expects that nonce (or a transformation of it) in the response. The response cannot have been stored or intercepted, it must be produced in response to a new nonce each time. (3) Name at least ve sources of natural random numbers. Truerandom number generators comprise a high-entropy source (any of those listed below) as their key component: (a) White-noise (audio captured from a computers microphone). (b) Computer environments ambient temperature or any source of thermal noise. (c) Ticks since last boot. (d) Keystrokes and mouse-movements. (e) Network latency, ICMP request response time (PING). (4) There are three typical ways to use nonces as challenges. Suppose Na is a nonce generated by an entity A, entities A and B share key K, and f () is a function such as increment. Three usages are given below: Usage 1 (1) A B : Na
1
B A : E(K, Na ) (2) Usage 2 (1) A B : E(K, Na ) B A : Na (2) Usage 3 (1) A B : E(K, Na ) (2) B A : E(K, f (Na ))
Describe situations for which each usage is appropriate. All three really serve the same purpose. The difference is in the vulnerability. In Usage 1, an attacker could breach security by inflating Na and withholding an answer from B for future replay attack, a form of suppress-replay attack. The attacker could attempt to predict a plausible reply in Usage 2, but this will not succeed if the nonces are random. In both Usage 1 and 2, the messages work in either direction. That is, if N is sent in either direction, the response is E[K, N]. In Usage 3, the message is encrypted in both directions; the purpose of function f is to assure that messages 1 and 2 are not identical. Thus, Usage 3 is more secure. (5) With DSS, because of the value of k is generated with each signature, even if the same message is signed twice on dierent occasions, the signature will dier. This is not true of RSA signatures. What is the practical implication of this dierence? The signer must be careful to generate the values of k in an Unpredictable manner, so that the scheme is not compromised.