Domain 3 Flashcards
Code
Cryptographic systems of symbols that
operate on words or phrases and are
sometimes secret but don’t always
provide confidentiality.
Cipher
Ciphers, are always meant to hide
the true meaning of a message.
Stream Cipher
is a symmetric key cipher where plaintext digits are combined with a pseudorandom cipher digit stream (keystream). In a stream cipher, each plaintext digit is encrypted one at a time with the corresponding digit of the keystream, to give a digit of the ciphertext stream
Block Cipher
is a method of encrypting text (to produce ciphertext) in which a cryptographic key and algorithm are applied to a block of data (for example, 64 contiguous bits) at once as a group rather than to one bit at a time.
Substitution Cipher
uses the encryption algorithm to replace each character or bit of the plaintext message with a different character. The Caesar cipher is a good example.
Transposition Cipher
uses an encryption algorithm to rearrange the letters of a plaintext message, forming the ciphertext message.
Initialization Vector (IV)
is a random bit string (a nonce) that is the same length as the block size that is XORed with the message. IVs are used to create a unique cipher text every time the same message is encrypted with the same key.
Caesar Cipher
substitution cipher that shifts characters, uses a key of length one
Vigenère Cipher
cipher uses a longer key (usually a word or sentence),
One time Pad Cipher
- For a one time pad to be successful, the key must be
- Generated randomly without any known pattern.
- Key at least as long as the message to be encrypted.
- The pads must be protected against physical disclosure
- Each pad must be used only one time and then discarded
Zero-knowledge proof
is a communication concept.
A specific type of information is exchanged, but no real data is transferred, as with digital signatures and digital
certificates.
More simply: It enables one to prove knowledge of a fact to another
individual without revealing the fact itself .
Split knowledge
means that the information or privilege
required to perform an operation is divided among multiple users.
This ensures that no single person has sufficient privileges to compromise the security of the environment.
Work function or work factor
a way to measure the strength of a cryptography system by measuring the effort in terms of cost and/or time to decrypt messages.
The time and effort required to break a protective measure.
Symmetric Key
Relies on the use of a shared secret key. Lacks support for scalability, easy key distribution, and nonrepudiation
Faster and for bulk encryption
Asymmetric
Public private key pairs for communication
between parties. Supports scalability, easy
key distribution, and nonrepudiation.
Stronger
3DES Modes
- Electronic Codebook Mode (ECB).
- Cipher Block Chaining (CBC).
- Cipher Feedback (CFB).
- Output Feedback (OFB).
- Counter (CTR).
3DES Mode - Electronic Codebook Mode (ECB).
Simplest & least secure mode. Processes 64 bit blocks, encrypts block with the chosen key. If same block encountered
multiple times, same encrypted block is produced, making it easy to break.
3DES Mode - Cipher Block Chaining (CBC).
Each block of unencrypted text is XORed with the block of ciphertext immediately preceding. Decryption process simply decrypts ciphertext and reverses the XOR operation.
3DES Mode - Cipher Feedback (CFB).
Is the streaming version of CBC. Works on data in real time, using memory buffers of same block size. When buffer is full, data is encrypted and transmitted. Uses chaining, so errors propagate.
3DES Mode - Output Feedback (OFB).
Operates similar to CFB, but XORs the plain text with a seed value. No chaining function, so errors do not propagate.
3DES Mode - Counter (CTR).
Uses an incrementing counter instead of a seed. Errors do not propagate.
Key Clustering
A Weakness in cryptography where a plain text message generates identical ciphertext messages using the same algorithm but using different keys.
Public Keys/Private Keys (asymmetric)
- Public keys are shared among communicating parties
- Private keys are kept secret.
DATA
- To encrypt a message: use the recipient’s public key.
- To decrypt a message: use your own private key.
DIGITAL SIGNATURE
- To sign a message: use your own private key.
- To validate a signature: use the sender’s public key.
HASH FUNCTION REQUIREMENTS
Good hash functions have five requirements:
- They must allow input of any length.
- Provide fixed length output
- Make it relatively easy to compute the hash function for any input
- Provide one way functionality.
- Must be collision free.