A. e
B. n
C. p
D. q
Answer: B
The number n is generated as the product of the two large prime numbers, p and q. Therefore, n must always be greater than both p and q. Furthermore, it is an algorithm constraint that e must be chosen such that e is smaller than n. Therefore, in RSA cryptography, n is always the largest of the four variables shown in the options to this question.
A. RSA
B. Diffie-Hellman
C. 3DES
D. IDEA
Answer: B
The El Gamal cryptosystem extends the functionality of the Diffie-Hellman key exchange protocol to support the encryption and decryption of messages.
A. Richard’s public key
B. Richard’s private key
C. Sue’s public key
D. Sue’s private key
Answer: C
Richard must encrypt the message using Sue’s public key so that Sue can decrypt it using her private key. If he encrypted the message with his own public key, the recipient would need to know Richard’s private key to decrypt the message. If he encrypted it with his own private key, any user could decrypt the message using Richard’s freely available public key. Richard could not encrypt the message using Sue’s private key because he does not have access to it. If he did, any user could decrypt it using Sue’s freely available public key.
A. 1,024 bits
B. 2,048 bits
C. 4,096 bits
D. 8,192 bits
Answer: C
The major disadvantage of the El Gamal cryptosystem is that it doubles the length of any message it encrypts. Therefore, a 2,048-bit plain-text message would yield a 4,096-bit ciphertext message when El Gamal is used for the encryption process.
A. 160 bits
B. 512 bits
C. 1,024 bits
D. 2,048 bits
Answer: A
The elliptic curve cryptosystem requires significantly shorter keys to achieve encryption that would be the same strength as encryption achieved with the RSA encryption algorithm. A 1,024-bit RSA key is cryptographically equivalent to a 160-bit elliptic curve cryptosystem key.
A. 160 bits
B. 512 bits
C. 1,024 bits
D. 2,048 bits
Answer: A
The SHA-1 hashing algorithm always produces a 160-bit message digest, regardless of the size of the input message. In fact, this fixed-length output is a requirement of any secure hashing algorithm.
A. SHA-2
B. PGP
C. WEP
D. TLS
Answer: C
The WEP algorithm has documented flaws that make it trivial to break. It should never be used to protect wireless networks.
A. TKIP
B. DES
C. 3DES
D. AES
Answer: A
WiFi Protected Access (WPA) uses the Temporal Key Integrity Protocol (TKIP) to protect wireless communications. WPA2 uses AES encryption.
A. Richard’s public key
B. Richard’s private key
C. Sue’s public key
D. Sue’s private key
Answer: B
Sue would have encrypted the message using Richard’s public key. Therefore, Richard needs to use the complementary key in the key pair, his private key, to decrypt the message.
A. Richard’s public key
B. Richard’s private key
C. Sue’s public key
D. Sue’s private key
Answer: B
Richard should encrypt the message digest with his own private key. When Sue receives the message, she will decrypt the digest with Richard’s public key and then compute the digest herself. If the two digests match, she can be assured that the message truly originated from Richard.
A. Digital Signature Algorithm
B. RSA
C. El Gamal DSA
D. Elliptic Curve DSA
Answer: C
The Digital Signature Standard allows federal government use of the Digital Signature Algorithm, RSA, or the Elliptic Curve DSA in conjunction with the SHA-1 hashing function to produce secure digital signatures.
A. X.500
B. X.509
C. X.900
D. X.905
Answer: B
X.509 governs digital certificates and the public key infrastructure (PKI). It defines the appropriate content for a digital certificate and the processes used by certificate authorities to generate and revoke certificates.
A. ROT13
B. IDEA
C. ECC
D. El Gamal
Answer: B
Pretty Good Privacy uses a “web of trust” system of digital signature verification. The encryption technology is based on the IDEA private key cryptosystem.
A. 80
B. 220
C. 443
D. 559
Answer: C
Transport Layer Security uses TCP port 443 for encrypted client-server communications.
A. Birthday attack
B. Chosen ciphertext attack
C. Meet-in-the-middle attack
D. Man-in-the-middle attack
Answer: C
The meet-in-the-middle attack demonstrated that it took relatively the same amount of computation power to defeat 2DES as it does to defeat standard DES. This led to the adoption of Triple DES (3DES) as a standard for government communication.
A. Rainbow tables
B. Hierarchical screening
C. TKIP
D. Random enhancement
Answer: A
Rainbow tables contain precomputed hash values for commonly used passwords and may be used to increase the efficiency of password cracking attacks.
A. Firewall to firewall
B. Router to firewall
C. Client to wireless access point
D. Wireless access point to router
Answer: C
The WiFi Protected Access protocol encrypts traffic passing between a mobile client and the wireless access point. It does not provide end-to-end encryption.
A. Key management
B. Latency
C. Record keeping
D. Vulnerability to brute-force attacks
Answer: B
Certificate revocation lists (CRLs) introduce an inherent latency to the certificate expiration process due to the time lag between CRL distributions.
A. El Gamal
B. RSA
C. Skipjack
D. Merkle-Hellman Knapsack
Answer: D
The Merkle-Hellman Knapsack algorithm, which relies on the difficulty of factoring super-increasing sets, has been broken by cryptanalysts.
A. All possible security classifications for a specific configuration
B. A framework for setting up a secure communication channel
C. The valid transition states in the Biba model
D. TCSEC security categories
Answer: B
IPsec is a security protocol that defines a framework for setting up a secure channel to exchange information between two entities.