Exam 11: Cryptographic Hash Functions
Exam 1: Overview45 Questions
Exam 2: Classical Encryption Techniques45 Questions
Exam 3: Block Ciphers and the Data Encryption Standard27 Questions
Exam 4: Basic Concepts in Number Theory and Finite Fields26 Questions
Exam 5: Advanced Encryption Standard45 Questions
Exam 6: Block Cipher Operation44 Questions
Exam 7: Random and Pseudorandom Number45 Questions
Exam 8: More Number Theory45 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: Key Management and Distribution45 Questions
Exam 15: User Authentication Protocols45 Questions
Exam 16: Network Access Control and Cloud Security45 Questions
Exam 17: Transport-Level Security26 Questions
Exam 18: Wireless Network Security45 Questions
Exam 19: Electronic Mail Security45 Questions
Exam 20: Ip Security44 Questions
Select questions type
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.8/5
(41)
The Secure Hash Algorithm design closely models,and is based on,the hash function __________ .
(Multiple Choice)
4.9/5
(34)
A hash function that satisfies the properties of variable input size,fixed output size,efficiency,preimage resistant and second preimage resistant is referred to as a __________.
(Multiple Choice)
4.8/5
(42)
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
(31)
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.7/5
(32)
Big-endian format is the most significant byte of a word in the low-address byte position.
(True/False)
4.8/5
(30)
The cryptographic hash function is not a versatile cryptographic algorithm.
(True/False)
4.9/5
(34)
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.
(Multiple Choice)
4.8/5
(33)
The SHA-512 algorithm has the property that every bit of the hash code is a function of every bit of the input.
(True/False)
4.8/5
(37)
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.
(True/False)
4.8/5
(40)
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 ___________ .
(Multiple Choice)
5.0/5
(41)
Hash functions are commonly used to create a one-way password file.
(True/False)
4.8/5
(35)
The hash value of a message in the __________ application is encrypted with a user's private key.
(Essay)
4.9/5
(28)
The compression function used in secure hash algorithms falls into one of two categories: a function specifically designed for the hash function or an algorithm based on a ___________ .
(Essay)
4.9/5
(46)
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.
(Essay)
4.8/5
(35)
It is possible to use a hash function but no encryption for message authentication.
(True/False)
4.7/5
(28)
Requirements for a cryptographic hash function include ___________ which is the one-way property.
(Essay)
4.8/5
(31)
Showing 21 - 40 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)