Week 4 Practice Quiz

1. 1When using the RSA, each member must generate two keys, an encrypted and a secret.
   
   

   1. ATrue
   2. BFalse
2. 2To generate the public key, we must first generate the RSA modulus by selecting two prime numbers.
   
   

   1. ATrue
   2. BFalse
3. 3The Chinese Remainder Theorem uses the Extended Euclidean algorithm in part of its process.
   
   

   1. ATrue
   2. BFalse
4. 4Digital Signatures are transmitted by themselves to ensure that the sender is authenticated.
   
   

   1. ATrue
   2. BFalse
5. 5Digital signatures use the sender’s private key to encrypt the hash.
   
   

   1. ATrue
   2. BFalse
6. 6In the CTR mode, the counter need not be synchronous for the sender and receiver.
   
   

   1. ATrue
   2. BFalse
7. 7When two different hash functions produce the same hash value, it is called a crash.
   
   

   1. ATrue
   2. BFalse
8. 8The “message digest”, or “hash value”, is like the fingerprint of a message.
   
   

   1. ATrue
   2. BFalse
9. 9Hash functions, just like the RSA algorithm, consist of keys.
   
   

   1. ATrue
   2. BFalse

Description

CPSI 4113 Quiz on Week 4 Practice Quiz, created by Adam Peterson on 17/09/2018.

Author

Adam Peterson

Language

English

Views

12

Tags

cpsi 4113

Rating

No ratings yet

Rate this quiz

Rate this quiz

More on Hash Functions and Message Authentication