C653, Section 001
Network Security
Spring, 2010
John Franco
Midterm Review
Question 1: RSA in trouble
Persons A, B , and C are all in the same group. Person A wishes to send the same message m
to person B and person C . Person A encrypts m using the RSA p
20-ECES-653-001
Network Security
Fall, 2007
John Franco
Midterm Exam
Name: M #:
Write clearly! I must be able to read what you write!
Question 1: Handshake Protocols 1. Assume a Server and Client share a secret key, K. Consider the following handshake bet
C653, Section 001
Network Security
Spring, 2009
Midterm Exam
Question 1: Chinese Remainder Theorem
State the Chinese Remainder Theorem and show why it works.
John Franco
Question 1: Chinese Remainder Theorem
State the Chinese Remainder Theorem and show wh
20-CS-653
Network Security
Fall, 2011
Midterm Exam
Name:
M Number:
Instructions: Answer all questions.
1. (5) Name three important security services
2. (3) What is 42 mod 16?
3. (4) What is a safe prime?
4. (4) How many square roots of 1 are there mod 12?