Question 1

The is a polygraphic substitution cipher based on linear algebra.
A)hill cipher
B)playfair cipher
C)affine cipher
D)none of these

Accepted Answer

The Hill cipher is a polygraphic substitution cipher based on linear algebra, specifically matrix multiplication.

Question 2

______________is the practice of concealing a message within another message,image or file.
A)steganography
B)cryptography
C)cipher
D)receiver

Accepted Answer

Steganography is the technique of hiding secret data within an ordinary, non-secret, file or message to avoid detection; the secret data is then extracted at its destination.

Question 3

In asymmetric key cryptography, the private key is kept by ______________ 
A)sender
B)receiver
C)sender and receiver
D)none of these

Accepted Answer

The private key is kept by the receiver in asymmetric key cryptography. This is because the private key is used to decrypt messages that have been encrypted with the public key. The public key is made public, so anyone can use it to encrypt messages. However, only the receiver has the private key, so only they can decrypt the messages.

Question 4

What is data encryption standard (DES)?
A)block cipher
B)stream cipher
C)bit cipher
D)byte cipher

Accepted Answer

Data Encryption Standard (DES) is a symmetric-key algorithm for the encryption of electronic data and operates on a block cipher principle, meaning it encrypts data in blocks.

Question 5

In cryptography the original message before being transform is called
A)simple text
B)plain text
C)empty text
D)filled text

Accepted Answer

In cryptography, the original message before any encryption or transformation is applied is referred to as "plain text."

Question 6

An asymmetric-key (or public-key) cipher uses
A)1 key
B)2 key
C)3 key
D)4 key

Accepted Answer

The answer of An asymmetric-key (or public-key) cipher uses
A)1 key
B)2...

Question 7

In Asymmetric-Key Cryptography, although RSA can be used to encrypt and decrypt actual messages, it is very slow if the message is
A)short
B)flat
C)long
D)thin

Accepted Answer

RSA, being a public-key cryptography algorithm, is computationally intensive and thus very slow for encrypting and decrypting long messages. For efficiency, it's often used to encrypt the keys of faster symmetric-key algorithms, which then encrypt the actual messages.

Question 8

The man-in-the-middle attack can endanger the security of the Diffie-Hellman method if two parties are not
A)authenticated
B)joined
C)submit
D)separate

Accepted Answer

The Diffie-Hellman method is vulnerable to man-in-the-middle attacks if the two parties are not authenticated. Without authentication, an attacker can intercept and modify the messages between the parties, effectively inserting themselves into the communication without detection.

Question 9

In Asymmetric-Key Cryptography, the two keys, e and d, have a special relationship to
A)other
B)data
C)keys
D)each other

Accepted Answer

In Asymmetric-Key Cryptography, the two keys, e (public key) and d (private key), have a special relationship to each other, where one key encrypts the data, and the other key is required to decrypt it.

Question 10

For RSA to work, the value of P must be less than the value of
A)p
B)q
C)n
D)r

Accepted Answer

In RSA, n is the product of two prime numbers, p and q. Therefore, p (and q) must be less than n for the algorithm to work correctly. n is used as the modulus for both the public and private keys.

Question 11

In RSA, ?(n) = in terms of p and q.
A)(p)/(q)
B)(p)(q)
C)(p-1)(q-1)
D)(p+1)(q+1)

Accepted Answer

In RSA, $ \phi(n) $ is calculated as $ (p-1)(q-1) $, where $ p $ and $ q $ are prime numbers. This is because $ \phi(n) $ represents the Euler's totient function, which counts the positive integers up to a given integer $ n $ that are relatively prime to $ n $. For a product of two distinct prime numbers $ p $ and $ q $, this is given by $ (p-1)(q-1) $.

Question 12

In RSA, we select a value 'e' such that it lies between 0 and ?(n) and it is relatively prime to ?(n).

Accepted Answer

In RSA, we select a value 'e' such that it lies between 1 and φ(n) (Euler's totient function of n) and it is relatively prime to φ(n), not between 0 and φ(n).

Question 13

RSA is also a stream cipher like Merkel-Hellman.

Accepted Answer

The answer of RSA is also a stream cipher like...

Question 14

USENET falls under which category of public key sharing?
A)public announcement
B)publicly available directory
C)public key authority
D)public key certificate

Accepted Answer

USENET is a system for public announcement, where users can post their public keys for others to access.

Question 15

PGP makes use of which cryptographic algorithm?
A)rsa
B)aes
C)des
D)robin

Accepted Answer

PGP (Pretty Good Privacy) primarily uses RSA for encrypting session keys and digital signatures.

Question 16

Public key cryptography also called as__________________________________________ 
A)asymmetric key cryptography
B)symmetric key cryptography
C)both a and b
D)none of the above

Accepted Answer

Public key cryptography is also known as asymmetric key cryptography because it uses two different keys for encryption and decryption, unlike symmetric key cryptography which uses the same key for both.

Question 17

ECC stands for
A)elliptic curve cryptography
B)elliptic cryptography curve
C)error correcting code
D)none of the above

Accepted Answer

ECC stands for elliptic curve cryptography, which is a type of public key cryptography based on the algebraic structure of elliptic curves over finite fields.

Question 18

Diffie-Hellman algorithm is widely known as__________________________________________
A)key exchange algorithm
B)key agreement algorithm
C)only a
D)both a and b

Accepted Answer

The Diffie-Hellman algorithm is widely known as both a key exchange algorithm and a key agreement algorithm, as it allows two parties to establish a shared secret over an insecure channel.

Question 19

Hash function is used for__________________________________________ 
A)message authentication
B)digital signature
C)both a and b
D)only a

Accepted Answer

Hash functions are used in both message authentication and digital signatures to ensure the integrity and authenticity of a message or document.

Question 20

RSA algorithm is best example of____________________________   
A)asymmetric key cryptography
B)symmetric key cryptography
C)elliptic curve cryptography
D)all of the above

Accepted Answer

RSA algorithm is a classic example of asymmetric key cryptography, where it uses a pair of keys for encryption and decryption processes—one public key and one private key.

Quiz 2: Cryptography and Security: Part A

The is a polygraphic substitution cipher based on linear algebra.

______________is the practice of concealing a message within another message,image or file.

In asymmetric key cryptography, the private key is kept by ______________

What is data encryption standard (DES) ?

In cryptography the original message before being transform is called

An asymmetric-key (or public-key) cipher uses

In Asymmetric-Key Cryptography, although RSA can be used to encrypt and decrypt actual messages, it is very slow if the message is

The man-in-the-middle attack can endanger the security of the Diffie-Hellman method if two parties are not

In Asymmetric-Key Cryptography, the two keys, e and d, have a special relationship to

For RSA to work, the value of P must be less than the value of

In RSA, ?(n) = in terms of p and q.

In RSA, we select a value 'e' such that it lies between 0 and ?(n) and it is relatively prime to ?(n).

RSA is also a stream cipher like Merkel-Hellman.

USENET falls under which category of public key sharing?

PGP makes use of which cryptographic algorithm?

Public key cryptography also called as__________________________________________

ECC stands for

Diffie-Hellman algorithm is widely known as__________________________________________

Hash function is used for__________________________________________

RSA algorithm is best example of____________________________