Vous êtes sur la page 1sur 10

Page 1 of 10

CS 372 Final Exam Solution


Summer 2014

August 13, 2014
Instructor: Mohamed Grissa
Duration: 50 minutes

Student Name: ____________________________ OSU ID: ______________


Problem Points Possible
1 29
2 12
3 21
4 17
5 21
Total 100




Instructions

Answer the questions in the spaces provided on the question sheets.
If you run out of room for an answer, continue on the back of the page.
Show your work. State any assumptions made.
One two-sided sheet of notes is allowed.

Good luck!!

Page 2 of 10


Problem I: Multiple Choice Questions (29 points, 4 minutes)

Choose the correct answer.

1. (4 points) Which of the following is a public key cryptography algorithm?
a) Monoalphabetic Cipher
b) Polyalphabetic Cipher
c) Block Cipher Chaining
d) Rivest, Shamir, Adleman algorithm

2. (4 points) What is a NIC?
a) Network Interface Controller
b) Network Interface Card
c) No Internet Connection
d) Network Internet Connection

3. (4 points) In the 802.11 standard, IEEE specifies what type of access method?
a) CSMA/CD
b) CSMA/CA
c) FDMA
d) TDMA

4. (4 points) Which of the following options hides the details of a home network from the rest
of the Internet?
a) ARP
b) DHCP
c) NAT
d) ICMP


Page 3 of 10


5. (4 points) Which layer is responsible for transferring data to adjacent network nodes over a
physical medium?
a) Transport Layer
b) Application Layer
c) Link Layer
d) Network Layer

6. (4 points) The protocol that requires a master node to grant access to each node in a collision
domain, in a round-robin fashion is called a
a) Token-passing protocol
b) Polling protocol
c) Random access protocol
d) None of the responses above is correct.

7. (2 points) The reasons for handling routing differently in Inter-AS and Intra-AS routing are
based On
a) Differences in router capabilities
b) Distance vector versus link state information
c) Policy, scale and performance
d) Imposed standards for packaging messages

8. (3 points) Random access protocols in shared bus networks use ______ to provide listen
before speaking and stop talking if someone else already is talking rules.
a) CSMA
b) SMDP
c) ALOHA
d) Slotted ALOHA



Page 4 of 10


9. (Bonus 2 points) Given the This protocol is used for error reporting in network layer
a) OSPF
b) ICMP
c) TCP
d) ARP

























Page 5 of 10


Problem II: General Short Answer (21 points, 5 minutes)

a) (4 points) Given the following forwarding table, complete the table below by specifying
on which of the outgoing interfaces each destination address will be forwarded.

b) (5 points) If a node has a wireless connection to the Internet, does that node have to be
mobile? Suppose that a user with a laptop walks around her house with her laptop, and
always accesses the Internet through the same access point. Is the user mobile from a
network standpoint? Explain!
Answer: No. User usually stays connected to a single access point while roaming around the
house.



c) (2 points)True or False, Datagram networks do not require call setup at the network
layer.
Answer: True
d) (Bonus 2 points) Briefly explain the hidden node problem.
Answer: A cannot detect a transmission from C and vice versa. If A and C start sending
simultaneously to B a collision at B will happen but A and C will not become aware of the
collision
Page 6 of 10

Problem III: Network Layer (21 points, 14 minutes)

For this problem your task is to create a network that consists of 3 routers. Each
router has 3 interfaces. On each router, 2 of these interfaces are connected to another
(distinct) router and one is connect to a host.
(a) (6 points) Draw the resulting topology of that network.



(b) (3 points) How many subnets does this network contain?
6
(c) (6 points) Assign an IP subnet address to each of these subnets such that a
maximum of 30 hosts can be connected to each subnet.
Look figure
(d) (6 points) Assign an IP address to each interface
Look figure




Page 7 of 10

Problem VI: Routing Algorithms (17 points, 11 minutes)

Consider the network shown below.

Figure 1
a) (12 Points) Show the operation of Dijkstras (LinkState) algorithm for computing the
least cost path from u to all destinations.
N

D(v), P(v) D(w), P(w) D(x), P(x) D(y), P(y) D(z), P(z)
u 6,u 5,u 6,u infinity infinity
u w 6,u - 6,u 14,w 6,w
u w v - - 6,u 14,w 6,w
u w v x - - - 12,x 6,w
u w v x z - - - 7,z -
u w v x z y - - - - -

b) (5 points) From these results, show the least cost path from u to all other nodes.
Answer: u-to-v, u-to-w, u-to-x, u-to-w-to-z-to-y, u-to-w-to-z.




Page 8 of 10

Problem V: Security (21 points, 16 minutes)

In order to provide confidentiality, integrity and authentication there are certain security
measures that need to be taken. Given the following diagram explain what Alice needs to do to
satisfy these security requirements for sending a secure email to Bob by filling in the boxes with
the correct notation using KS(.), K
-
A(.), K
+
A(.), K
-
B(.), K
+
B(.), H(.).

a. (5 points) Secure Email


Figure 3


b. (5 points) How does Bob decrypt the message, check for authentication and
integrity (using same notation from above)
Page 9 of 10







c. (6 points) Assume Bobs RSA public key is (n,e) and corresponding private key
is (n,d). Which of the following could be used as RSA key pairs (ignoring the
fact that they are too small)? For those that are valid key pairs, show that they
meet all the requirements for a key pair, for those that are not, explain why they
are not.
1. (31,5) (31,11): could not be used since n = 31 cannot be decomposed into a
product of two prime numbers




Page 10 of 10

2. (77,7) (77,43): n = 77 = 7*11 = p*q, z = (p-1)(q-1) = 6*10 = 60
e = 7, d = 43, e has no common factor with d.
ed-1 = 7*43-1 = 300 which is divisible by z = 60.
So this is a valid key pair

3. (55,7) (55,41): n = 55 = 5*11 = p*q, z = (p-1)(q-1) = 4*10 = 40
e = 7, d = 41, e has a common factor with d which is 3
So this is not a valid key pair


d. (4 points) Consider the pair (91,5), (91,29). Assume the first is the encryption
key and the second is the decryption key. What is the encrypted value of the
number 10?
Answer : m = 10, e = 5, n = 91. The ciphertext c = m
e
mod n = 10
5
mod 91 = 82

Vous aimerez peut-être aussi