212-81 Practice Test

Created in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT. Most widely used public key cryptography algorithm. Based on relationships with prime numbers. This algorithm is secure because it is difficult to factor a large integer composed of two or more large prime factors.

A. PKI

B. DES

C. RSA

D. Diffie-Helmann

What is the basis for the difficulty in breaking RSA?

A. Hashing

B. The birthday paradox

C. Equations that describe an elliptic curve

D. Factoring numbers

What is a salt?

A. Key whitening

B. Random bits intermixed with a symmetric cipher to increase randomness and make it more secure

C. Key rotation

D. Random bits intermixed with a hash to increase randomness and reduce collisions

With Electronic codebook (ECB) what happens:

A. The message is divided into blocks and each block is encrypted separately. This is the most basic mode for symmetric encryption

B. The cipher text from the current round is XORed with the plaintext from the previous round

C. The block cipher is turned into a stream cipher

D. The cipher text from the current round is XORed with the plaintext for the next round

Which one of the following attempts to hide data in plain view?

A. Cryptography

B. Substitution

C. Steganography

D. Asymmetric cryptography