Midterm Exam 2 - Cryptography Computer Network Security - Fall 2000 | ECE 646, Exams of Cryptography and System Security

Material Type: Exam; Class: Cryptography/Comp Netwk Sec; Subject: Electrical & Computer Enginrg; University: George Mason University; Term: Unknown 1989;

Typology: Exams

2019/2020

Uploaded on 11/25/2020

koofers-user-49f
koofers-user-49f 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 646, Midterm Exam 2
Fall 2000
Multiple-choice test
1. (1 pt) Standard techniques used for padding of the RSA messages in
signatures with appendix include
A. ISO 9796
B. PKCS #1 (ver. 1.5) for encryption
C. ISO-14888
D. OAEP
E. PKCS #1 (ver. 1.5) for signatures
2. (1 pt) Using OAEP (Optimal Asymmetric Encryption Padding) before the
RSA encryption protects against the following attacks:
A. superencryption attack
B. encrypting a set of most likely messages with the public key, and
comparing the result with the ciphertext
C. factoring the modulus N using the General Number Field Sieve Method
D. short message attack (e=3, M<N1/3)
E. factoring the modulus N using Pollard's p-1 method
3. (1.5 pt) Match each RSA modulus N with the most efficient currently
known method of factoring a number of the given form and size:
A. N=PQ, where P - 25 decimal digit prime, Q - 275 decimal digit prime
B. N=PQ, where P - 50 decimal digit prime, Q - 50 decimal digit prime
C. N=PQ, where P = 2521-1, Q - 50 decimal digit prime
D. N=PQ, where P - 50 decimal digit prime, Q - 100 - decimal digit prime
E. N=PQ, where P = 2512+1, Q - 50 decimal digit prime
a. GNFS - General Number Field Sieve
b. QS - Quadratic Sieve
c. Pollard's P-1 method
d. ECM - Elliptic Curve Method
e. Cyclotomic Polynomial Method
pf3

Partial preview of the text

Download Midterm Exam 2 - Cryptography Computer Network Security - Fall 2000 | ECE 646 and more Exams Cryptography and System Security in PDF only on Docsity!

ECE 646, Midterm Exam 2 Fall 2000

Multiple-choice test

  1. (1 pt) Standard techniques used for padding of the RSA messages in signatures with appendix include

A. ISO 9796

B. PKCS #1 (ver. 1.5) for encryption C. ISO- D. OAEP E. PKCS #1 (ver. 1.5) for signatures

  1. (1 pt) Using OAEP (Optimal Asymmetric Encryption Padding) before the RSA encryption protects against the following attacks:

A. superencryption attack B. encrypting a set of most likely messages with the public key, and comparing the result with the ciphertext C. factoring the modulus N using the General Number Field Sieve Method D. short message attack ( e =3, M < N 1/3) E. factoring the modulus N using Pollard's p-1 method

  1. (1.5 pt) Match each RSA modulus N with the most efficient currently known method of factoring a number of the given form and size:

A. N=P⋅Q, where P - 25 decimal digit prime, Q - 275 decimal digit prime B. N=P⋅Q, where P - 50 decimal digit prime, Q - 50 decimal digit prime C. N=P⋅Q, where P = 2^521 -1, Q - 50 decimal digit prime D. N=P⋅Q, where P - 50 decimal digit prime, Q - 100 - decimal digit prime E. N=P⋅Q, where P = 2^512 +1, Q - 50 decimal digit prime

a. GNFS - General Number Field Sieve b. QS - Quadratic Sieve c. Pollard's P-1 method d. ECM - Elliptic Curve Method e. Cyclotomic Polynomial Method

  1. (1.5 pt) Arrange the following tests for primality in the order of the decreasing worst case probability of error, i.e., the worst case probability of returning the result "prime" or "probably prime" for a composite number.

A. Single execution of the ECPP (Elliptic Curve Primality Proof) test B. 5 iterations of the Miller-Rabin test C. 5 iterations of the Frobenius-Grantham test D. 5 iterations of the Fermat's test

  1. (1 pt) The ratio of times necessary to generate the DSA public-private key pair on a smart card without an arithmetic coprocessor for the size of the system parameter p L=2048 and L=1024 is

A. 2 B. 4 C. 8 D. 16 E. 32