Exam 2: Cryptography and Security: Part A
Exam 1: Security Measures and Encryption Techniques for Information Protection25 Questions
Exam 2: Cryptography and Security: Part A24 Questions
Exam 3: Cryptography and Security: Part B7 Questions
Exam 4: Information Security and Encryption24 Questions
Exam 5: Network Security and Cryptographic Protocols24 Questions
Select questions type
An attempt to make a computer resource unavailable to its intended users is called ____________________________
Free
(Multiple Choice)
4.8/5
(34)
Correct Answer:
A
The is a polygraphic substitution cipher based on linear algebra.
Free
(Multiple Choice)
4.9/5
(40)
Correct Answer:
A
In cryptography the original message before being transform is called
(Multiple Choice)
4.8/5
(28)
______________is the practice of concealing a message within another message,image or file.
(Multiple Choice)
4.8/5
(46)
SSL primarily focuses on ____________________________ Pretty good privacy (PGP) is used in
(Multiple Choice)
4.9/5
(34)
Diffie-Hellman algorithm is widely known as__________________________________________
(Multiple Choice)
4.9/5
(30)
In Asymmetric-Key Cryptography, the two keys, e and d, have a special relationship to
(Multiple Choice)
4.8/5
(39)
In asymmetric key cryptography, the private key is kept by ______________
(Multiple Choice)
4.8/5
(34)
RSA algorithm is best example of____________________________
(Multiple Choice)
4.9/5
(35)
IPSec is designed to provide security at the __________________________________________
(Multiple Choice)
4.9/5
(30)
The man-in-the-middle attack can endanger the security of the Diffie-Hellman method if two parties are not
(Multiple Choice)
4.8/5
(33)
Public key cryptography also called as__________________________________________
(Multiple Choice)
4.8/5
(33)
Hash function is used for__________________________________________
(Multiple Choice)
4.8/5
(39)
In Asymmetric-Key Cryptography, although RSA can be used to encrypt and decrypt actual messages, it is very slow if the message is
(Multiple Choice)
4.8/5
(30)
In RSA, we select a value 'e' such that it lies between 0 and ?(n) and it is relatively prime to ?(n).
(True/False)
4.9/5
(30)
Showing 1 - 20 of 24
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)