Chapter 3 Key terms

A symmetric cipher that was approved by the NIST in late 2000 as a replacement for DES. To date, AES is the most secure symmetric cipher.

Procedures based on a mathematical formula used to encrypt and decrypt the data. Also called a cipher.

Cryptography that uses two mathematically related keys.

A statistical phenomenon that makes finding collisions easier.

A cipher that manipulates an entire block of plaintext at one time.

A block cipher that operates on 64-bit blocks and can have a key length from 32 to 448 bits.

another name for algorithm.

When two files have the same hash.

An attempt to find two input strings of a hash function that produce the same hash result.

A means to thwart statistical analysis so that the key does not relate in a simple way to the ciphertext.

The practice of transforming information so that it is secure and cannot be accessed by unauthorized persons.

One of the first widely popular symmetric cryptography algorithms. No longer considered secure.

Data that is stored on electronic media.

Actions that transmit the data across a network.

Data actions being performed by “endpoint devices,” such as printing a report from a desktop computer.

A cryptographic algorithm that is still available but should not be used because of known vulnerabilities.

A key exchange that requires all parties to agree upon a large prime number and related integer so that the same key can be separately created.

A Diffie-Hellman key exchange that uses different keys.

A means to thwart statistical analysis so that if a single character of plain-text is changed then it should result in multiple characters of the ciphertext changing.

An electronic verification of the sender.

A U.S. federal government standard for digital signatures.

An attack in which the system is forced to abandon the current higher security mode of operation and fall back to implementing an older and less secure mode.

An algorithm that uses elliptic curves instead of prime numbers to compute keys.

A Diffie-Hellman key exchange that uses elliptic curve cryptography instead of prime numbers in its computation.

The process of changing plaintext into ciphertext.

A temporary key that is used only once before it is discarded.

Encryption that protects all data on a hard drive.

Free and open-source software that is commonly used to encrypt and decrypt data.

A dedicated cryptographic processor that provides protection for cryptographic keys.

An algorithm that creates a unique digital fingerprint called a “digest.”

HMAC. A hash function used to authenticate the sender.

The ability to quickly recover from resource vs. security constraints.

The process of sending and receiving secure cryptographic keys. Also the specific handshake setup between web browser and web server.

Using statistical tools to attempt to discover a pattern in ciphertexts; also called ciphertext only attack.

A small amount of time that occurs between when a byte is input into a cryptographic algorithm and the time the output is obtained.

Small electronic devices that consume very small amounts of power.

Message Digest 5. A revision of MD4 that was designed to address MD4’s weaknesses.

Breaches of cryptography that are the result of incorrect configuration or uses of the cryptography.

the process of proving that a user performed an action.

Making something obscure or unclear.

Public key systems that generate random public keys that are different for each session.

A commercial product that is commonly used to encrypt files and messages.

An asymmetric encryption key that does have to be protected.

Pseudorandom number generation. An algorithm for creating a sequence of numbers whose properties approximate those of a random number.

An asymmetric encryption key that does not have to be protected.

A hash algorithm that uses two different and independent parallel chains of computation and then combines the result at the end of the process.
Race integrity primitives evaluation message digest.

Numbers for which there is no identifiable pattern or sequence.

An RC stream cipher that will accept keys up to 128 bits in length.

A limitation in providing strong cryptography due to the tug-of-war between the available resources (time and energy) and the security provided by cryptography.

One type of substitution cipher in which the entire alphabet is rotated 13 steps.

The most common asymmetric cryptography algorithm.

A secure hash algorithm that creates more secure hash values than Message Digest (MD) algorithms.

A false notion that virtually any system can be made secure so long as outsiders are unaware of it or how it functions.

Self encrypting drives. Drives that can automatically encrypt any data stored on it.

Hiding the existence of data within another type of file, such as an image file.

An algorithm that takes one character and replaces it with one character.

An encryption algorithm that substitutes one character for another.

Encryption that uses a single key to encrypt and decrypt a message.

Triple data encryption standard. A symmetric cipher that was designed to replace DES. No longer considered the most secure symmetric cipher.

Trusted Platform module. A chip on the motherboard of the computer that provides cryptographic services.

A derivation of the Blowfish algorithm that is considered to be strong.

An encryption algorithm based on the binary operation eXclusive OR that compares two bits.