WorksheetsIAS QUIZ 11
Total questions: 25
Worksheet time: 13mins
Virtually all cryptographic hash functions involve the iterative use of a compression function.
T
F
Limited characteristics make it impossible for hash functions to be used to determine whether or not data has changed.
F
T
Hash functions can be used for intrusion and virus detections.
T
F
The cryptographic hash function is not a versatile cryptographic algorithm.
F
T
it is possible to use a hash function but no encryption for message authentication.
T
F
Hash functions are commonly used to create a one-way password file.
T
F
A weak hash function is sufficient to protect against an attack in which one party generates a message for another party to sign.
T
F
The way to measure the resistance of a hash algorithm to cryptanalysis is to compare its strength to the effort required for a
brute-force attack.
T
F
It can be shown that some form of birthday attack will succeed against any hash scheme involving the use of cipher block chaining without a secret key, provided that either the resulting hash code is small enough or that a larger hash code can be
decomposed into independent subcodes.
T
F
The most widely used hash function has been the Whirlpool.
F
T
Big-endian format is the most significant byte of a word in the low-address byte position.
T
F
Encryption hardware is optimized toward smaller data sizes.
F
T
Whirlpool is a popular cryptographic hash function
T
F
A good hash function has the property that the results of applying the function to a large set of inputs will produce outputs that are
evenly distributed and apparently random.
T
F
The principal object of a hash function is __________.
data integrity
compression
mapping messages
collision resistance
A ___________ accepts a variable length block of data as input and produces a fixed size hash value h = H(M).
hash function
hash resistance
hash value
hash code
The Secure Hash Algorithm design closely models and is based on, the hash function __________ .
MD4
MD5
FIPS 180
RFC 4634
A ___________ is an algorithm for which it is computationally infeasible to find either (a) a data object that maps to a pre-specified hash result or (b) two data objects that map to the same hash result.
cryptographic hash function
One-way hash function
strong collision resistance
compression function
The cryptographic hash function requirement that guarantees that it is impossible to find an alternative message with the same hash value as a given message and prevents forgery when an encrypted hash code is used is the ___________.
second preimage resistant
Collision resistant
pseudorandomness
preimage resistant
__________ is a mechanism or service used to verify the integrity of a message.
Message authentication
Data compression
Data mapping
Message digest
Message authentication is achieved using a __________.
MAC
DES
MDF
SHA
__________ are measures of the number of potential collisions for a given hash value.
Primitives
MACs
Hash codes
Preimages
A hash function that satisfies the properties of variable input size, fixed output size, efficiency, preimage resistance, and second preimage resistance is referred to as a __________.
weak hash function
strong hash function
collision resistant function
preimage resistant function
The effort required for a collision-resistant attack is explained by a mathematical result referred to as the ___________.
birthday paradox
Whirlpool
hash value
message authentication code
The SHA-512 algorithm has the property that every bit of the hash code is a function of every bit of the input.
T
F
