COMPUTER ETHICS AND SECURITY
CRYPTOGRAPHY AND ENCRYPTION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Diffusion
|
|
|
Confusion
|
|
|
Obfuscation
|
|
|
Collision
|
Detailed explanation-1: -In symmetric encryption the same key is used for encryption and decryption. It is therefore critical that a secure method is considered to transfer the key between sender and recipient.
Detailed explanation-2: -If we need to randomize an encryption scheme, we commonly use an initialization vector or an IV. This is a type of nonce that provides randomization for this encryption process.
Detailed explanation-3: -Asymmetric Key Algorithms The Diffie-Hellman algorithm is mostly used for key exchange. Although symmetric key algorithms are fast and secure, key exchange is always a problem. You have to figure out a way to get the private key to all systems. The Diffie-Hellman algorithm helps with this.
Detailed explanation-4: -CCMP mode is for use with AES. It uses a 128-bit block size and a 128-bit key size and is capable of handling messages up to 16 bytes. CCMP mode was designed to address some of the problems with the CBC mode of operation in which the same block of plaintext can encrypt to different ciphertexts.