Free INTRODUCTION-TO-CRYPTOGRAPHY Practice Test Questions and Answers (2026)

One-way server authentication is the process where a server proves its identity to a client, but the client's identity is not cryptographically verified by the server. This is the standard model for most web traffic using TLS/SSL (e.g., HTTPS). A web service (the server) presents its digital certificate to the customer's browser (the client) to prove it is the legitimate entity associated with the domain name, ensuring the customer is connecting to the intended service.

A. One-way client authentication involves the client proving its identity to the server, which is the reverse of the scenario described.

C. Mutual authentication requires both the server and the client to prove their identities to each other, which is more than the question asks for.

D. End-to-end authentication is a general term for security between two endpoints and does not specify the direction of the identity verification.

1. Internet Engineering Task Force (IETF). (2018). RFC 8446: The Transport Layer Security (TLS) Protocol Version 1.3. Section 4.2, "Server Parameters," and Section 4.4, "Authentication Messages," describe the process where the server sends its certificate and proves possession of the private key to authenticate itself to the client.

2. Dierks, T., & Allen, C. (1999). RFC 2246: The TLS Protocol Version 1.0. Section 7.4, "Server and client authentication." This foundational RFC distinguishes between anonymous, server-only, and mutual authentication.

3. Kurose, J. F., & Ross, K. W. (2017). Computer Networking: A Top-Down Approach (7th ed.). Pearson. Chapter 8.3, "Securing TCP Connections: SSL," explains that in the standard SSL/TLS handshake, the server authenticates itself to the client using a certificate.

In a digital signature scheme, the roles of the keys are distinct and opposite to their roles in encryption for confidentiality. The sender uses their private key to compute the signature on a message or its hash. This action can only be performed by the holder of the private key, ensuring authenticity and non-repudiation. The recipient, or any third party, then uses the sender's corresponding public key to validate the signature. A successful validation proves the message was signed by the owner of the private key and has not been altered.

A. Using a private key for both signing and validation is not possible in an asymmetric system and would serve no purpose.

C. Using a public key for signing would allow anyone to create a signature, defeating the goal of proving a unique origin.

D. This reverses the roles; signing with a public key and validating with a private key is functionally incorrect and insecure.

1. National Institute of Standards and Technology (NIST). (2013). FIPS PUB 186-4, Digital Signature Standard (DSS). Section 4.1, "Digital Signature Generation and Verification," states that a private key is used for signature generation and the corresponding public key is used for verification.

2. Stallings, W. (2017). Cryptography and Network Security: Principles and Practice (7th ed.). Pearson. Chapter 13, "Digital Signatures," explicitly describes the process: "The sender signs a message with its private key. Signing is achieved by a cryptographic algorithm applied to the message or to a small block of data that is a function of the message." Verification is then done with the public key.

3. Paar, C., & Pelzl, J. (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Springer. Chapter 10, "Digital Signatures," Figure 10.1 illustrates the process where Alice signs with her private key (Kpr,A) and Bob verifies with her public key (Kpub,A).

The provided hash string $2a$08$AbCh0RCM8p8FGaYvRLI0H.Kng54gcnWCOQYIhas708UEZRQQjGBh4 follows the Modular Crypt Format (MCF). The prefix $2a$ is the specific identifier for the bcrypt hashing algorithm. Bcrypt is an adaptive password hashing function that was designed to be slow to compute, making it resistant to brute-force attacks. It inherently incorporates a salt into the process; in this example, the salt is AbCh0RCM8p8FGaYvRLI0H.. The question asks which algorithm was used, which is identified by the prefix.

A. NTLM is a Microsoft authentication protocol; its hash format is completely different and does not use the $2a$ prefix.

B. SHA-512 based hashes used in modern Linux systems are identified by the prefix $6$, not $2a$.

C. MD5 based hashes used in older Linux systems are identified by the prefix $1$, not $2a$.

1. Provos, N., & Mazières, D. (1999). A Future-Adaptable Password Scheme. Proceedings of the FREENIX Track: 1999 USENIX Annual Technical Conference. (This is the original paper on bcrypt, which details the algorithm and its goals).

2. Linux manual page, crypt(3). This official documentation describes the various hashing schemes used, including the prefixes for MD5 ($1$), bcrypt ($2a$), SHA-256 ($5$), and SHA-512 ($6$).

3. NIST Special Publication 800-63B, Digital Identity Guidelines: Authentication and Lifecycle Management, Section 5.1.1.2, recommends using adaptive one-way functions like bcrypt for storing password verifiers.

Symmetric ciphers, by themselves, provide confidentiality but not integrity. To add integrity, a Message Authentication Code (MAC) is required. A MAC is a small piece of information used to authenticate a message. A common and secure method for creating a MAC is to use a cryptographic hash function in combination with a secret key. This construction is known as a Hash-based Message Authentication Code (HMAC). The hash function processes the message to create a fixed-size digest, and the inclusion of the secret key ensures that only someone possessing the key can generate or verify the MAC, thus providing both integrity and authenticity.

A. Initialization vector: An IV is used to ensure semantic security for confidentiality by randomizing encryption; it does not provide integrity.

B. Encoding algorithm: Encoding (e.g., Base64) is for data representation and transport, not for ensuring cryptographic integrity.

C. Nonce value: A nonce ensures uniqueness and prevents replay attacks but does not, by itself, verify that the message content has not been altered.

1. Krawczyk, H., Bellare, M., & Canetti, R. (1997). RFC 2104: HMAC: Keyed-Hashing for Message Authentication. The document defines HMAC, which uses a cryptographic hash function and a secret key to produce a MAC for data integrity and authenticity. (Section 2).

2. Katz, J., & Lindell, Y. (2014). Introduction to Modern Cryptography (2nd ed.). CRC Press. Chapter 4, "Message Authentication Codes," explains that MACs are used for integrity and details the HMAC construction based on hash functions. (pp. 107-110).

3. National Institute of Standards and Technology (NIST). (2008). FIPS PUB 198-1: The Keyed-Hash Message Authentication Code (HMAC). This standard specifies the HMAC algorithm, which "uses a cryptographic hash function and a secret cryptographic key" to provide message integrity. (p. 1).

In the Advanced Encryption Standard (AES) algorithm, the number of transformation rounds applied to the data is directly dependent on the length of the key used. A longer key requires more rounds to ensure a thorough diffusion of the key's influence throughout the ciphertext, thus providing greater security. Specifically, a 128-bit key uses 10 rounds, a 192-bit key uses 12 rounds, and a 256-bit key uses 14 rounds. Therefore, as the key length increases, the number of rounds also increases.

A. The number of rounds increases, not decreases, with key length to provide a higher security margin against attacks for longer keys.

C. The key length and number of rounds are directly correlated; changing one necessitates a specific value for the other according to the standard.

D. The number of rounds is not the same; it is explicitly defined to be different for each of the three standard key lengths.

1. National Institute of Standards and Technology (NIST). (2001). FIPS PUB 197: Advanced Encryption Standard (AES). Section 5, "Algorithm Specification," p. 13, Table 1 "Key-Block-Round Combinations".

2. Paar, C., & Pelzl, J. (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Springer. Chapter 4, "The Advanced Encryption Standard (AES)," Section 4.2.1, p. 97.

The expression "51 mod 11" asks for the remainder when 51 is divided by 11. This is a standard modular arithmetic operation. To calculate this, we find the largest multiple of 11 that is less than or equal to 51. In this case, 11 multiplied by 4 is 44. We then subtract this multiple from 51 to find the remainder: 51 - 44 = 7. Therefore, the value of 51 mod 11 is 7.

A. The remainder is not 4. 11 4 + 4 = 48, not 51.

B. The remainder is not 5. 11 4 + 5 = 49, not 51.

D. The result of a modulo n operation must be an integer in the range [0, n-1]. 11 is outside the range [0, 10].

1. Rosen, K. H. (2019). Discrete Mathematics and Its Applications (8th ed.). McGraw-Hill. Chapter 4, Section 4.1, "Divisibility and Modular Arithmetic," Definition 4, p. 271.

2. Paar, C., & Pelzl, J. (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Springer. Chapter 4, Section 4.2, "The Integers," pp. 88-89.

3. MIT OpenCourseWare. (2015). Mathematics for Computer Science (6.042J). Fall 2010. Lecture 10: Number Theory I, Section 2.1 "The Modulo Operator."

A cryptography framework provides a set of pre-built, well-tested, and standardized tools, libraries, and protocols for implementing cryptographic functions. Its key benefit is offering a structured and reliable approach, which helps developers avoid common and often subtle implementation errors that can lead to severe security vulnerabilities. By using a vetted framework, developers can leverage expert-designed components for tasks like encryption, hashing, and key management, rather than attempting to build them from scratch—a practice widely discouraged as "rolling your own crypto."

A. No security measure, including a cryptography framework, can guarantee complete security against all possible attacks. This is an unrealistic absolute.

B. Frameworks simplify implementation but do not eliminate the need for training. Developers and users must still understand security principles to use the framework correctly.

C. While frameworks help achieve regulatory compliance (e.g., FIPS), their primary purpose is to provide secure functionality, not just to meet regulations.

1. OWASP Foundation. (2023). Cryptographic Storage Cheat Sheet. "Developers should never invent their own cryptographic algorithms or protocols... Instead, they should use a standard, well-vetted, and maintained library for the language they are using." This highlights the benefit of a structured approach. (Rule 1 section).

2. Ferguson, N., Schneier, B., & Kohno, T. (2010). Cryptography Engineering: Design Principles and Practical Applications. Wiley. The book repeatedly emphasizes the difficulty of correctly implementing cryptography and advocates for using existing, proven libraries and protocols. (Chapter 21, "Implementing the System").

3. Boneh, D., & Shoup, V. (2017). A Graduate Course in Applied Cryptography. Stanford University. The text implicitly supports the use of frameworks by detailing the complexity and pitfalls of cryptographic design, suggesting that non-experts should rely on standardized, reviewed implementations. (Preface, Page v).

Software-based disk encryption solutions operate within the host operating system to encrypt all data stored on a volume. BitLocker is a full-volume encryption feature included with Microsoft Windows versions, and FileVault is the equivalent full-disk encryption tool for Apple's macOS. Both are prime examples of software solutions that encrypt data at rest on disk storage, protecting it from unauthorized access if the physical drive is stolen.

A. A Virtual Private Network (VPN) is a network security tool that encrypts data in transit over a public network, not data at rest on a disk.

B. A Hardware Security Module (HSM) is a dedicated hardware device for managing cryptographic keys and performing crypto operations, not a software disk encryption solution itself.

D. USB encryption hardware refers to self-encrypting drives, which are a hardware-based solution, not a software one as specified in the question.

1. Microsoft. (2023). BitLocker overview. Microsoft Docs. "BitLocker Drive Encryption is a data protection feature that integrates with the operating system and addresses the threats of data theft or exposure from lost, stolen, or inappropriately decommissioned computers." (Overview section).

2. Apple Inc. (2023). Use FileVault to encrypt the startup disk on your Mac. Apple Support. "FileVault full-disk encryption (FileVault 2) uses XTS-AES-128 encryption with a 256-bit key to help prevent unauthorized access to the information on your startup disk." (Introduction paragraph).

3. Casey, E., & Cheval, D. (2012). Full-Disk Encryption. In Handbook of Digital Forensics and Investigation. Academic Press. This chapter describes software-based FDE and explicitly mentions BitLocker and FileVault as leading examples. (Chapter 13, Section "Software-Based FDE").

Large prime numbers are fundamental to the security of many asymmetric (public-key) encryption algorithms, most notably RSA. The security of these systems is based on the computational difficulty of the integer factorization problem. An algorithm's public key may include a large number that is the product of two secret, very large prime numbers. While multiplying these primes is easy, determining the original prime factors from their product is computationally infeasible with current technology. This "trapdoor" function ensures that only someone with knowledge of the prime factors (the private key) can efficiently decrypt messages.

A. Operations with very large numbers, including primes, are computationally intensive and slow down encryption, they do not make it faster.

B. They make authorized decryption possible for the key holder but make unauthorized decryption (cryptanalysis) computationally infeasible for an attacker.

C. Primes are used to generate keys, which are then used in the encryption/decryption process, not for directly encoding the message content itself.

1. Rivest, R. L., Shamir, A., & Adleman, L. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2), 120–126. Section V, "The Encryption Method." https://doi.org/10.1145/359340.359342

2. Stallings, W. (2017). Cryptography and Network Security: Principles and Practice (7th ed.). Pearson. Chapter 9, "Public-Key Cryptography and RSA," Section 9.2, "The RSA Algorithm," pp. 273-278.

3. Boneh, D. (n.d.). Stanford University Coursera: Cryptography I. Week 4 Video Lectures, "Number Theory for Cryptography."

Asymmetric encryption, also known as public-key cryptography, uses a pair of mathematically related keys: a public key and a private key. A message encrypted with the public key can only be decrypted by the corresponding private key, and vice versa. This is fundamentally different from symmetric encryption, where a single, shared key is used for both encryption and decryption. The use of two distinct keys is the defining characteristic of this cryptographic system.

A. Symmetric encryption uses the exact same key for both the encryption and decryption processes.

B. Private key is the name of one of the keys in an asymmetric pair, not the name of the encryption type itself.

C. Secure is a qualitative description of an encryption system's strength, not a classification of its key methodology.

1. Katz, J., & Lindell, Y. (2014). Introduction to Modern Cryptography (2nd ed.). CRC Press. Chapter 10, "Public-Key Cryptosystems," defines the system as using a public key (pk) for encryption and a private key (sk) for decryption.

2. National Institute of Standards and Technology (NIST). (2020). Special Publication 800-57 Part 1 Rev. 5, Recommendation for Key Management. Section 2.1.3, "Asymmetric-key (or public-key) cryptography," states it uses two related keys, a public key and a private key.

3. Rivest, R. L., Shamir, A., & Adleman, L. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2), 120–126. https://doi.org/10.1145/359340.359342. This foundational paper introduces the concept of using separate public and private keys.