Cryptography Flashcards
This is a simple substitution cipher that shifts the alphabet by three positions.
A. Scytale cipher
B. Concealment cipher
C. Vigenere
D. Caesar cipher
Caesar cipher
This encryption method involves wrapping a message around a rod.
A. Scytale cipher
B. Vernam
C. Vigenere
D. Caesar cipher
Scytale cipher
This is the first polyalphabetic cipher. To encrypt, the first letter of the key is matched with the first letter of the message on a polyalphabetic table.
A. Scytale cipher
B. Vernam
C. Vigenere
D. Caesar cipher
Vigenere
This cryptography method involved using a specially made device with 3 or 4 rotors. The devices on each end of transmission would need to put the rotors in the same configuration.
Enigma machine
This is the only mathematically unbreakable form of cryptography. Often referred to as a one-time pad, it requires:
- The key be used only once
- The pad must be at least as long as the message
- The key pad must be statistically unpredictable
- The key must be delivered and stored securely
Vernam cipher
The science of studying and breaking the secrecy of encryption processes, compromising authentication schemes, and reverse engineering algorithms and keys.
Cryptanalysis
A cyptovariable which has a value that comprises a large sequence of random bits
Key
The RANGE of values that can be used to construct a key.
Keyspace
PGP is an example of a cryptosystem. Cryptosystems must be made of at least the following four things:
Software
Protocols
Algorithms
Keys
This principal asserts that algorithms should be publicly known in order to reduce the chance of more vulnerabilities.
Kerckhoff’s Principle
What unit of measure is used for attacks on cryptosystems?
The number of instructions a million-instruction-per-second (MIPS) system can execute in a year.
Name five services that cryptosystems can provide:
1 Confidentiality 2 Integrity 3 Authentication 4 Authorization (Upon proving identity, the individual is provided with a key or password that will allow access to some other resource.) 5 Nonrepudiation
XOR the following into a ciphertext stream:
Message Stream: 100101
Keystream: 010111
Ciphertext: 110010
Bob uses a 32-bit one-time pad to encrypt a 64 bit message. Sally was able to crack the code. How is this possible?
Bob used a pad that was shorter than the message. This can cause patterns to appear in the ciphertext.
This cipher uses objects in the physical world, like a book, to act as a key.
A. Scytale cipher
B. Concealment cipher
C. Running key cipher
D. Caesar cipher
Running key cipher
This cipher hides a message within a message and is a type of stenography.
A. Scytale cipher
B. Concealment cipher
C. Running key cipher
D. Caesar cipher
Concealment cipher
The method of embedding a message into some types of media (stenography) is to use the LSB. What does LSB stand for?
Least-significant bit
Symmetric encryption algorithms use two basic types of ciphers: substitution and transposition (permutation). What form of attack are simple versions of these ciphers susceptible to?
Frequency Analysis
___________ are used to generate subkeys that are made up of random values.
Key Derivation Functions (KDFs)
Which of the following is a strength of symmetric key systems:
A. Much faster than asymmetric systems
B. Hard to break if using a large key size
C. Provides confidentiality but not authenticity and non-repudiation.
D. Both A and B.
D
Which of the following is a strength of asymmetric key systems:
A. Works more slowly than symmetric systems.
B. Can provide authentication and non-repudiation.
C. Much faster than symmetric key systems.
D. Doesn’t scale as fast as symmetric key systems.
B
For asymmetric systems, what is the equation used to determine the number of keys to manage given a certain number of people (N)?
A. N(N-1)/2 = Number of Keys
B. N(N-2)/2 = Number of Keys
C. N(N-1) = Number of Keys
D. 2N
2N
For symmetric systems, what is the equation used to determine the number of keys to manage given a certain number of people (N)?
A. N(N-1)/2 = Number of Keys
B. N(N-2)/2 = Number of Keys
C. N(N-1) = Number of Keys
D. 2N
A N(N-1)/2 = Number of Keys
Which of the following are examples of asymmetric algorithms? (You can choose more than one.)
A. DES
B. RC4
C. ECC
D. Diffie-Hellman
C and D
Which of the following are examples of symmetric algorithms? (You can choose more than one.)
A. El Gamal
B. RC4
C. SHA
D. DSA
B
Which of the following are examples of asymmetric algorithms? (You can choose more than one.)
A. ECC
B. RSA
C. Blowfish
D. Diffie-Hellman
A, B, and D