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 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 ___________ .
(Short Answer)
4.8/5
(33)
the __________ resistant guarantees that it is impossible to find an alternative message with the same hash value as a given message.
(Short Answer)
4.9/5
(31)
the most important and widely used family of cryptographic hash functions is the __________ family.
(Short Answer)
4.7/5
(39)
three new versions of SHA with hash value lengths of 256, 384, and 512 bits are collectively known as __________ .
(Multiple Choice)
4.8/5
(32)
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
(32)
Showing 41 - 45 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)