WorksheetsTAC3121-Quiz 4
Total questions: 10
Worksheet time: 10mins
In public key encryption, the most difficult adversarial goal is to distinguish pairs of ciphertexts based on the message.
True
False
CPA can always be mounted against a public key encryption scheme as anyone can do encryption given a public key.
True
False
The most desirable security notion in a public key encryption is the indistinguishability against chosen ciphertext attack.
True
False
The security of RSA is based on the difficulty of factoring.
True
False
According to Kerchoff's principle, it is fine to publicise the factors of n which are p and q in RSA.
True
False
Chinese Remainder Theorem can be used to speed up the modulo computation in RSA by anyone.
True
False
Both RSA and El Gamal encryption are CPA-secure but not CCA-secure.
True
False
The security of El Gamal encryption is based on the difficulty of Discrete Logarithm problem.
True
False
In RSA, the decryption key d cannot be computed knowing the factors p and q.
True
False
The defense against the brute-force attack is possible for RSA by using a larger key space.
True
False
