📝 PGP Pretty Good Privacy in email (23 MCQs)
📖 From Data Communication and Networks • 32. Internet Security • 23 questions available
What is PGP Pretty Good Privacy in email?
Pretty Good Privacy (PGP) is a decentralized email security program that uses a web-of-trust model combined with symmetric and asymmetric encryption to provide confidentiality, authentication, and message integrity for individual users.
📝 All PGP Pretty Good Privacy in email MCQs
Q1. If a sender encrypts a message with the recipient’s public key in PGP, which statement must be true for confidentiality?
📖 Explanation: Because PGP uses the recipient’s public key to encrypt, only the holder of the corresponding private key – the intended recipient – can reverse the encryption. The sender cannot decrypt, and the public key alone does not provide decryption capability, ensuring confidentiality for the intended party.
Q2. When Alice signs a message with her private signing key, what can Bob reliably infer after verifying the signature with Alice’s public key?
📖 Explanation: Verification with Alice’s public key proves that the signature was produced by the matching private key, which only Alice should possess. This guarantees authenticity (the sender is Alice) and integrity (the content has not changed) but does not provide encryption or any information about key compromise.
Q3. Given the current interval in an arithmetic encoder, if the next symbol narrows the interval by a factor of , what is the new interval’s lower bound?
📖 Explanation: In arithmetic coding, the lower bound of the interval remains unchanged while the width is multiplied by the probability factor. Multiplying the original width by yields a new width of . Thus the lower bound stays at .}
Q4. If a recipient’s private decryption key is accidentally exposed, which of the following consequences is most direct?
📖 Explanation: Exposure of the private decryption key means anyone possessing it can decrypt any ciphertext encrypted with the corresponding public key. Consequently, all past communications that relied on that key lose confidentiality, while signatures and the web of trust remain technically functional.
Q5. Why does PGP typically compress data before encrypting it?
📖 Explanation: Compressing plaintext reduces its size, meaning fewer bits are processed by the symmetric cipher, which speeds up encryption and decryption. Although compression can also obscure redundancy, its primary purpose in PGP is to improve efficiency rather than to provide additional cryptographic strength.
Q6. An attacker captures a large number of ciphertexts encrypted with the same symmetric session key but different public keys. Which attack becomes feasible?
📖 Explanation: When many ciphertexts share the same session key, statistical patterns can emerge, allowing an attacker to perform a key‑recovery attack by exploiting the redundancy of the symmetric encryption. This is why PGP generates a fresh random session key for each message.
Q7. In PGP’s web of trust, what is the immediate effect when a user marks another’s key as “fully trusted”?
📖 Explanation: Marking a key as fully trusted tells PGP that the signer’s judgments are reliable. Consequently, any keys that this trusted signer has certified inherit trust, simplifying verification for the user without requiring direct signatures from every individual key.
Q8. Which statement best describes the purpose of a revocation certificate in PGP?
📖 Explanation: A revocation certificate is a specially signed statement that the key owner creates (often at key generation). When published, it signals to others that the associated public key is no longer valid, preventing further use and alerting the community to stop trusting that key.
Q9. If a user’s key is revoked but several contacts still have outdated copies of the key, what is the most likely consequence?
📖 Explanation: Revocation does not propagate magically; contacts must obtain the updated keyring. Those who retain the old, now‑revoked key may still encrypt messages to it, which the original owner can no longer decrypt, leading to loss of confidentiality and possible communication breakdown.
Q10. Compare the use of symmetric encryption in PGP with using symmetric encryption alone. Which advantage does the hybrid approach provide?
📖 Explanation: PGP’s hybrid scheme encrypts the bulk data with a fast symmetric cipher, then encrypts the randomly generated session key with the recipient’s public key. This combines the speed of symmetric encryption with the secure key exchange properties of asymmetric cryptography, solving the key‑distribution problem.
Q11. Evaluate the impact of using a 1024‑bit RSA key versus a 4096‑bit RSA key in PGP. Which statement is most accurate?
📖 Explanation: A 4096‑bit RSA modulus dramatically increases the difficulty of factoring, thus enhancing security. However, the larger modulus makes modular exponentiation slower, leading to longer encryption and decryption times. Therefore, the trade‑off is stronger security at the cost of performance.
Q12. Which block cipher mode is most commonly used by PGP for encrypting the session key, and why?
📖 Explanation: PGP traditionally employs Cipher Block Chaining (CBC) when encrypting data with a symmetric algorithm. CBC introduces an initialization vector (IV) that randomizes the first block, preventing identical plaintext blocks from producing identical ciphertext blocks, thus enhancing confidentiality.
Q13. Assess the effect of compressing data before encryption on both ciphertext size and security. Which outcome is correct?
📖 Explanation: Compressing before encryption shrinks the plaintext, leading to smaller ciphertext. However, because compression removes redundancy, it can reveal statistical information about the original data (e.g., length patterns) that an attacker might exploit, so it does not uniformly improve security.
Q14. Compare two common methods for distributing revocation information in PGP. Which pair correctly describes them?
📖 Explanation: Revocation certificates can be published on public key servers, making them globally accessible, or they can be directly shared as signed revocation certificates to contacts. Both methods rely on the signature’s authenticity, but the former offers broader distribution while the latter is more targeted.
Q15. The content shows the interval and a factor of . If the arithmetic encoder uses this factor to select a sub‑interval, what is the most plausible new upper bound?
📖 Explanation: Starting with width , multiplying by yields a new width of . Adding this to the lower bound gives an upper bound of . This reflects how arithmetic coding narrows the interval proportionally to symbol probabilities.
Q16. Apply the confidentiality‑integrity‑authenticity triad to a typical PGP workflow. Which sequence best reflects the order of operations?
📖 Explanation: In a standard PGP process, the sender first creates a digital signature (authenticity), then compresses the signed data (efficiency), encrypts the compressed block with a symmetric session key (confidentiality), and finally encrypts the session key with the recipient’s public key. This order preserves integrity and confidentiality throughout transmission.
Q17. Synthesize a secure multi‑recipient exchange using PGP. Which steps must be performed to ensure that each recipient can decrypt the file while preserving the sender’s signature?
📖 Explanation: The proper procedure is to first sign the plaintext (providing authenticity), then encrypt the signed data with a randomly generated symmetric session key (ensuring confidentiality), and finally encrypt that session key with each recipient’s public key. This allows all recipients to recover the same signed content.
Q18. Explain how the strength of a user’s passphrase influences the security of the symmetric key derived from it. Which statement is most accurate?
📖 Explanation: PGP often derives a symmetric key from a user‑chosen passphrase. If the passphrase is short or common, attackers can guess it using dictionary or brute‑force techniques, thereby compromising the derived key. Strong, high‑entropy passphrases dramatically increase the effort required to recover the key.
Q19. Discuss why PGP incorporates both symmetric and asymmetric encryption rather than relying on a single method. Which rationale best captures this design choice?
📖 Explanation: PGP’s hybrid design leverages the speed of symmetric algorithms for bulk data encryption while using asymmetric encryption to securely exchange the randomly generated session key. This balances performance with the strong key‑distribution properties of public‑key cryptography.
Q20. In a scenario where the web of trust fails because a trusted introducer is compromised, what mitigation strategy is most effective?
📖 Explanation: If a trusted introducer’s key is compromised, all signatures that rely on that trust become suspect. Publishing revocation certificates for the compromised key and for any keys it signed forces the community to re‑evaluate trust relationships, limiting the spread of the breach.
Q21. Apply the concept of key escrow to PGP. Which implication is most accurate if an escrow authority holds a copy of users’ private keys?
📖 Explanation: Key escrow stores a backup of private keys with a trusted third party. While it provides a recovery mechanism, it also means the escrow authority possesses the capability to decrypt any ciphertext encrypted to those keys, thereby compromising the absolute confidentiality that PGP otherwise offers.
Q22. Why does PGP employ a random initialization vector (IV) for block cipher modes like CBC?
📖 Explanation: An IV introduces randomness to the first block of encryption, guaranteeing that identical plaintexts encrypted with the same key produce different ciphertexts. This prevents attackers from inferring relationships between messages, a crucial property for maintaining confidentiality in block cipher modes.
Q23. What does the acronym PGP stand for?
📖 Explanation: PGP stands for Pretty Good Privacy, a widely used program that provides cryptographic privacy and authentication for data communication. It was originally created by Phil Zimmermann in 1991 and has become a de facto standard for email encryption.