Chapter 11: Cryptographic Hash Functions

Save

Students also studied

Flashcard sets Study guides

Module 2 ITN 262 QUIZ chapter 6 Chapter 13: Digital Signatures AFH 1 CHAPTER 17 SECURITY SECTI... SY0-60

46 terms 21 terms 44 terms 100 term

Skilltastic1 Preview jal0040 Preview michael_easter55 Preview Me

Get a taste for our practice questions

Learn 1 /7 Study with Learn

a scheme in which a hash of a password is stored by an operating system rather than the

password itself.

Give this one a try later!

one-way password file 2 cryptographic hash function

3 collision 4 Keyed hash function

Don't know?

H accepts a variable-length block of data M as input and produces a fixed-size hash

hash function
value h=H(M)

data integrity the principal object of a hash function

a ________ to any bit or bits in M results, with high probability, in a change to the hash
change
value

needed for security applications. algorithm for which it is computationally infeasible

cryptographic hash function to find either 1) a data object that maps to a pre-specified has result or 2) two data

objects that map to the same hash result

message authentication is a mechanism or service used to verify the integrity of a message.

When a hash function is used to provide message authentication, the hash function
message digest
value is often referred to as

secure the hash value must be transmitted in a ________ fashion.

A key-dependent, one-way hash function that allows only specific recipients

Message Authentication Code (MAC)
(symmetric key holders) to access the message digest.

Keyed hash function aka message authentication code

digital signature hash value is encrypted with with a user's private key. similar to a MAC

a scheme in which a hash of a password is stored by an operating system rather than

one-way password file
the password itself.

The process of identifying attempts or actions to penetrate a system and gain

intrusion detection
unauthorized access

Virus detection The process of detecting possible malicious software and files in a computer system

pseudorandom function a cryptographic has function can be used to create a

preimage h=H(x), we say that x is the _______ of h

collision occurs when x not equal to y and H(x) = H(y)

variable input size, fixed output size, requirements for the practical application of a hash function

efficiency

is the one-way property. It is easy to generate a code given a message but virtually
preimage resistant
impossible to do the inverse.

Property of a cryptographic hash function where it is computationally infeasible to

find any second input which has the same output as any specified input.

second preimage resistant For any given input x, it is computationally infeasible to find input y != x with Hash(y) =

Hash(x).

(Weak collision resistant)

has variable input size, fixed output size, efficiency, preimage resistant and second
weak hash function
preimage resistant

strong hash function has properties of weak hash function plus collision resistant.

pseudorandomness not traditionally listed as a requirement of chf but is implied.

brute force attack depends only on the bit length of the hash value

Cryptanalysis attack based on weaknesses in a particular crypto function

preimage or second preimage attacks an adversary wishes to find a value y such that H(y) is equal to a given hash value h.

an adversary wishes to find two messages or data blocks, x and y that yield that
collision resistant attacks
same hash function

it is possible to find a collision of a hash function but rare. and takes a lot of
Birthday Paradox
effort/time.

takes a fixed length input and returns a shorter, fixed-length output with the final
compression function
output being the hash value for the message.

Cryptanalysis attack that tries to uncover a mathematical problem from two different
meet-in-the-middle-attack
ends.

A secure hash algorithm that creates more secure hash values than Message Digest
Secure Hash Algorithm (SHA)
(MD) algorithms.
 takes an input message and partitions it into fixed-sized blocks. Each block is

sponge construction processed in turn with the output of each iteration fed into the next iteration, finally

producing an output block.

each iteration, the input block is processed by being padded with zeroes to extend

its length from r bits to b bits. Then bitwise XOR of the extended message block and
absorbing phase
s is formed to create a b-bit input to the iteration function f. The output of f is the

value of s for the next iteration.

he first r bits of the state are returned as output blocks, inter-leaved with

squeezing phase applications of the function f. The number of output blocks is chosen at will by the

user.

Birthday Attack a probability method of finding a collision in a hash function

bitrate the number of bits per second a system can transmit

capacity the maximum amount that something can contain.

This function operates to update each bit based on its current value and the value of
chi step function collision resistant
the corresponding bit position in the next two lanes in the same row.

A function that maps a bit string of arbitrary length to a fixed length bit string.

Approved hash functions satisfy the following properties:

1. (One-way) It is computationally infeasible to find any input which maps to any pre-
Cryptographic Hash Function
specified output, and

2. (Collision resistant) It is computationally infeasible to find any two distinct inputs

that map to the same output.

A method of coding to obtain a search key for the purpose of storing and retrieving
hash code
items of data.

A number produced by a hash function to create a unique digital "fingerprint" that

hash value
can be used to allow or deny access to a software application.

This function combines each array element with a round constant that differs for
iota step function
each round. It breaks up any symmetry induced by the other four routines.

The integrity hash algorithms chosen as the next standard for hashing, also known as
keccak
SHA-3.

is an algorithm that uses a cryptographic key AND a cryptographic hash function to

keyed hash function
produce a message authentication code that is keyed and hashed

cryptographic hash function submitted to the NIST hash function competition. It re-
lane
uses many components from AES in a custom construction

little endian if the least significant byte is transmitted first or stored on the lower address

is a message digest algorithm (the fourth in a series) designed by Professor Ronald

MD4 Rivest of MIT in 1990. It implements a cryptographic hash function for use in message

integrity checks. The digest length is 128 bits.

message-digest algorithm that is a one-way cryptographic function that accepts a

MD5 message of any length as input and returns as output a fixed-length digest value to

be used for authenticating the original message.

Pi step function is a permutation of lanes: the lanes move position within the 5×5 matrix.

consists of a simple permutation (circular shift) within each lane. The intent is to

Rho step function provide diffusion within each lane. Without this function diffusion between lanes

would be very slow.

Second preimage resistant (weak collision is the property of a hash function that it is computationally infeasible to find any

resistant) second input that has the same output as a given input
 most often used to verify that a file has been unaltered. This is done by producing a

checksum before the file has been transmitted, and then again once it reaches its
SHA-1
destination. The transmitted file can be considered genuine only if both checksums

are identical.

a one-way hash function that provides 112 bits of security, which is the generally
SHA-224
accepted strength of Triple-DES [3DES]

SHA-256 is a patented cryptographic hash function that outputs a value that is 256 bits long

Designed by NSA. 224/256/384/512 bit output size, up to 1600 bit block size, 64 bit
SHA-3
word size, 24 rounds.

belongs to the SHA-2 family of cryptographic hashes. It produces the 384 bit digest
SHA-384
of a message. is roughly 50% faster than SHA-224 and SHA-256

a hashing algorithm used to convert text of any length into a fixed-size string. Each

SHA-512 output produces a length of 512 bits (64 bytes). This algorithm is commonly used for

email addresses hashing, password hashing, and digital record verification.

A property of a hash function such that it is computationally infeasible to find any

Strong Collision Resistance pair (x, y) such that H(x) = H(y). In other words, it is hard to find ANY two values with

the same hash value. Not susceptible to birthday attack.

provides a high level of diffusion on average and that without it, the round function
Theta step function
would not provide diffusion of any significance.

A property of a hash function such that it is computationally infeasible to find y ≠x

with
Weak Collision Resistance
H(y) = H(x). In other words, to find two different values with the same hash value. Still

susceptible to birthday attack.