CRYPTOGRAPHY UNIT 2

Lecture 7:
1. A block cipher is a deterministic algorithm operating on fixed-length
groups of bits, called 
a. Streams b. Blocks c. Cryptography d. Bits
2. must be provided to both users in advance via some
independent and secure channel
a. Keystream b. Plain text c. Cipher text d. Stream
3. Shannon’s concern was to thwart cryptanalysis based on
a. Cryptanalysis b. Statistical analysis c. Cryptography d.Blocks
4. A  is a permutation of all the bits.
a. Combination box b. Substitution box c. Permutation box
d. Stream ciphers
5. A  substitutes a small block of input bits with another
block of output bits.
a. Permutation box b. Combination box c. Substitution box
d. Encryption
 Lecture 8:

1. Data are encrypted in 64-bit blocks using a

a. 32-bit keys b. 56-bit keys c. 64-bit keys d. 16-bit keys
2. Electronic Frontier Foundation (EFF) announced that it had broken a new
DES encryption using a machine
a. DES b. BES c. MES d. PES
3. A 128-bit key is guaranteed for unbreakable algorithm by
a. Brute Force b. Backtracking c. Dictionary attack d.DDOS
4. The Data Encryption Standard is a   for the encryption of
digital data.
a. Symmetric key algorithm b. Public key c. Asymmetric key
algorithm d. Private key
5. DES was issued in 1977 by
a. National bureau of Standards
b. National bureau of Cryptology
c. National bureau of Brute force
d. National bureau of Technology
Lecture 9:

1. The concept of public-key cryptography evolved from an attempt to

attack two of the most difficult problems associated with
a. Symmetric encryption b. Asymmetric encryption

c. Symmetric decryption d. Asymmetric decryption

2. A public-key encryption scheme has ingredients

a. Six b. Three c. Five d. Four
3. In the sender “signs” a message with its private key
a. Electronic Signature b. Digital Signature

c. Physical Signature d. Manual Signature

4. can be thwarted by appending some random bits to

simple messages
a. Physical attack b. Probable message attack c. Brute Force
d. Backtracking
5. In the sender encrypts a message with the recipient’s
public key
a. Private key encryption b. Private key encryption

c. Asymmetric key encryption d. Symmetric key encryption

Lecture 10

1. scheme was developed in 1977 at MIT by Ron

Rivest, Adi Shamir & Len Adleman
a. RSA b. DES c. PES d. EDS
2. RSA (Rivest–Shamir–Adleman) is an cryptographic
algorithm
a. Asymmetric b. Symmetric c. Encryption d. Decryption
3. The involves inducing single-bit errors and observing
the results
a. Fault based Attack b. Brute Force c. RSA d. DES

4. A  is an attack model for cryptanalysis
a. Fault based attack b. Brute force attack
c. Chosen-cipher text attack c. None of the above
5. attack on the running time of the decryption
algorithm
a. Brute force attack b. Fault based attack c. Timing attack
d. None of the above
 Answers

Lecture 7 Lecture 8 1. Symmetric Lecture 10

encryption
1. Blocks 1. 56-bit keys 1. Rivest-Shamir-
2. Six
2. Keystream 2. DES Machine Adleman (RSA)
3. Digital
3. Statistical 3. Brute-Force 2. Asymmetric
Signature
Analysis 4. Symmetric-key 3. Fault based
4. Probable-
4. Permutation algorithm  attack algorithm
message attack
box (P-box)  5. National Bureau 4. Chosen-
5. Public key
5. Substitution of Standards ciphertext
encrption
box (S-box) attack 
5. Timing attacks
Lecture 9