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 _______.