Exam 11: Cryptographic Hash Functions
Exam 1: Computer and Network Security Concepts45 Questions
Exam 2: Introduction to Number Theory13 Questions
Exam 3: Classical Encryption Techniques45 Questions
Exam 6: Advanced Encryption Standard45 Questions
Exam 7: Block Cipher Operation45 Questions
Exam 8: Random Bit Generation and Stream Ciphers45 Questions
Exam 9: Public-Key Cryptography and Rsa45 Questions
Exam 10: Other Public-Key Cryptosystems45 Questions
Exam 11: Cryptographic Hash Functions45 Questions
Exam 12: Message Authentication Codes45 Questions
Exam 13: Digital Signatures45 Questions
Exam 14: Lightweight Cryptography and Post-Quantum Cryptography45 Questions
Exam 15: Cryptographic Key Management and Distribution45 Questions
Exam 16: User Authentication45 Questions
Exam 18: Wireless Network Security45 Questions
Exam 19: Electronic Mail Security45 Questions
Exam 20: Ip Security44 Questions
Exam 21: Network Endpoint Security45 Questions
Exam 22: Cloud Security44 Questions
Exam 23: Internet of Things Iot Security45 Questions
Select questions type
the Secure Hash Algorithm was developed by the ___________ .
(Multiple Choice)
4.8/5
(28)
If collision resistance is required the value _________ determines the strength of the hash code against brute-force attacks.
(Short Answer)
4.9/5
(29)
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.
(True/False)
4.8/5
(36)
Big-endian format is the most significant byte of a word in the
low-address byte position.
(True/False)
4.7/5
(35)
the effort required for a collision resistant attack is explained by a mathematical result referred to as the ___________ .
(Multiple Choice)
4.7/5
(27)
"Given a hash function H, with n possible outputs and a specific value H(x), if H is applied to k random inputs, what must be the value of k so that the probability that at least one input y satisfies H(y) = H(x) is 0.5" is a reference to the __________ .
(Multiple Choice)
4.8/5
(24)
It is possible to use a hash function but no encryption for message
authentication.
(True/False)
4.8/5
(32)
the cryptographic hash function is not a versatile cryptographic
algorithm.
(True/False)
4.8/5
(31)
A hash function that satisfies the properties of variable input size, fixed output size, efficiency, preimage resistant, second preimage resistant and __________ is referred to as a strong hash function.
(Short Answer)
4.8/5
(36)
When a hash function is used to provide message authentication, the hash function value is often referred to as a ___________ .
(Short Answer)
4.8/5
(36)
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".
(True/False)
4.8/5
(33)
the two categories of attacks on hash functions are __________ attacks and cryptanalysis.
(Short Answer)
4.8/5
(33)
An ideal hash algorithm will require a cryptanalytic effort __________ the brute-force effort.
(Multiple Choice)
4.9/5
(40)
Virtually all cryptographic hash functions involve the iterative use
of a compression function.
(True/False)
4.7/5
(35)
Requirements for a cryptographic hash function include ___________ which is the one-way property.
(Short Answer)
4.8/5
(35)
A weak hash function is sufficient to protect against an attack in
which one party generates a message for another party to sign.
(True/False)
4.7/5
(34)
Showing 21 - 40 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)