Question

1.A good hash function is resistant to _______. 2.The term _______ _______ refers to an arranged group of different algorithms used for authentication, encryption/decryption, digital signatures, and hashing. 3._______ functions are very special type of encryption algorithms that takes an input and mathematically reduces it to a unique number that is not reversible. 4._______ functions are difficult to process without the key but easy to process when you have the key. 5.The term _______ refers to every possible value for a cryptographic key. 6.Making two inputs result in the exact same cryptographic hash is called a(n) _______ _______ . 7.Agents intercept a message that is encrypted, and proceed to use various techniques to try and decipher the plain text message. This is an example of _______.

Answer 1

1.
A good hash function is resistant to Collisions
Answer: Collisions

2.
The term cryptographic algorithms refers to an arranged group of different algorithms used for authentication, encryption/decryption, digital signatures, and hashing.
Answer: cryptographic algorithms

3.
hash functions are very special type of encryption algorithms that takes an input and mathematically reduces it to a unique number that is not reversible.
Answer: hash

4.
hash functions are difficult to process without the key but easy to process when you have the key.
Answer: trapdoor

5.
The term Keyspace refers to every possible value for a cryptographic key.
Answer: Keyspace

6.
Making two inputs result in the exact same cryptographic hash is called a(n) Collision Attack.
Answer: Collision Attack.

7. Agents intercept a message that is encrypted, and proceed to use various techniques to try and decipher the plain text message. This is an example of Steganography
Answer: Steganography