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 evaluation criteria for SHA-3 are security, ___________, and algorithm and implementation characteristics.
Free
(Short Answer)
4.8/5
(37)
Correct Answer:
cost
the hash value of a message in the __________ application is encrypted with a user's private key.
Free
(Short Answer)
4.8/5
(40)
Correct Answer:
digital signature
__________ is a mechanism or service used to verify the integrity of a message.
Free
(Multiple Choice)
4.9/5
(33)
Correct Answer:
A
A message authentication code is also known as a __________ hash function.
(Short Answer)
4.8/5
(28)
the hash algorithm involves repeated use of a __________ function, f, that takes two inputs (an n-bit input and a b-bit block) and produces an n-bit output.
(Short Answer)
4.9/5
(37)
the Secure Hash Algorithm design closely models, and is based on, the hash function __________ .
(Multiple Choice)
4.7/5
(27)
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
(29)
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
(34)
the kind of hash function needed for security applications is referred to as a __________ hash function.
(Short Answer)
4.9/5
(31)
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)
4.8/5
(29)
SHA-1 is very similiar in structure and in the basic mathematical operations used to __________ and SHA-0.
(Short Answer)
4.8/5
(34)
Hash functions are commonly used to create a one-way password
file.
(True/False)
4.8/5
(29)
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
(37)
__________ are measures of the number of potential collisions for a given hash value.
(Multiple Choice)
5.0/5
(34)
A __________ is an attack based on weaknesses in a particular cryptographic algorithm.
(Short Answer)
4.9/5
(31)
A ___________ accepts a variable length block of data as input and produces a fixed size hash value h = H(M).
(Multiple Choice)
4.8/5
(38)
Limited characteristics make it impossible for hash functions to be
used to determine whether or not data has changed.
(True/False)
4.8/5
(28)
Showing 1 - 20 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)