Eccouncil 212-81 Practice Exam Questions & Answers
Eccouncil 212-81 Exam Details
Key details for this exam, checked against the published exam outline
- Exam Code
- 212-81
- Full Name
- Certified Encryption Specialist
- Issuing Body
- EC-Council
- Question Format (Our Bank)
- Multiple Choice
- Delivery
- Online proctored via EC-Council Exam Portal or onsite at EC-Council Authorized Testing Centers
- Full Question Set
- 206 questions Get All Questions
Free 212-81 Practice Questions
Each question shows the correct answer and an explanation of why it is right
Question 1 Domain 2 Symmetric Cryptography and Hashes
Which one of the following is an example of a symmetric key algorithm?
Rijndael
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
The Advanced Encryption Standard (AES), also known by its original name Rijndael. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data.
Incorrect answers:
ECC - Elliptic-curve cryptography is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security.
Diffie--Hellman - key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.
RSA - Rivest--Shamir--Adleman is a public-key cryptosystem that is widely used for secure data transmission. It is also one of the oldest. The acronym RSA comes from the surnames of Ron Rivest, Adi Shamir, and Leonard Adleman, who publicly described the algorithm in 1977.
Question 2 Domain 2 Symmetric Cryptography and Hashes
A simple algorithm that will take the initial key and from that generate a slightly different key each round.
Key Schedule
https://en.wikipedia.org/wiki/Key_schedule
In cryptography, the so-called product ciphers are a certain kind of cipher, where the (de-)ciphering of data is typically done as an iteration of rounds. The setup for each round is generally the same, except for round-specific fixed values called a round constant, and round-specific data derived from the cipher key called a round key. A key schedule is an algorithm that calculates all the round keys from the key.
Incorrect answers:
Feistel Network - (also known as Luby--Rackoff block cipher) is a symmetric structure used in the construction of block ciphers, named after the German-born physicist and cryptographer Horst Feistel who did pioneering research while working for IBM (USA).
SHA-2 - (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001. They are built using the Merkle--Damgrd structure, from a one-way compression function itself built using the Davies--Meyer structure from a specialized block cipher.
Diffie--Hellman - key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.
Question 3 Domain 1 Introduction and History of Cryptography
How did the ATBASH cipher work?
By substituting each letter for the letter from the opposite end of the alphabet (i.e. A becomes Z, B becomes Y, etc.)
https://en.wikipedia.org/wiki/Atbash
The Atbash cipher is a particular type of monoalphabetic cipher formed by taking the alphabet (or abjad, syllabary, etc.) and mapping it to its reverse, so that the first letter becomes the last letter, the second letter becomes the second to last letter, and so on.
Get the complete 212-81 question set
$20$40
Question 4 Domain 3 Number Theory and Asymmetric Cryptography
Uses a formula, M_n = 2^n 1 where n is a prime number, to generate primes. Works for 2, 3, 5, 7 but fails on 11 and on many other n values.
Correct answers: Mersenne Primes
https://en.wikipedia.org/wiki/Mersenne_prime
Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form M_n = 2^n 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2^n 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form M_p = 2^p 1 for some prime p.
Incorrect answers:
Even Numbers - A formal definition of an even number is that it is an integer of the form n = 2k, where k is an integer; it can then be shown that an odd number is an integer of the form n = 2k + 1 (or alternately, 2k - 1). It is important to realize that the above definition of parity applies only to integer numbers, hence it cannot be applied to numbers like 1/2 or 4.201. See the section 'Higher mathematics' below for some extensions of the notion of parity to a larger class of 'numbers' or in other more general settings.
Fibonacci Numbers - commonly denoted F_n, form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1.
Co-prime Numbers - two integers a and b are said to be relatively prime, mutually prime, or coprime if the only positive integer (factor) that evenly divides both of them is 1. Consequently, any prime number that divides one of a or b does not divide the other. This is equivalent to their greatest common divisor (gcd) being 1.
Question 5 Domain 3 Number Theory and Asymmetric Cryptography
Which of the following asymmetric algorithms is described by U.S. Patent 5,231,668 and FIPS 186
DSA
https://ru.wikipedia.org/wiki/DSA
The National Institute of Standards and Technology (NIST) proposed DSA for use in their Digital Signature Standard (DSS) in 1991, and adopted it as FIPS 186 in 1994.
DSA is covered by U.S. Patent 5,231,668 , filed July 26, 1991 and now expired, and attributed to David W. Kravitz, a former NSA employee.
Question 6 Domain 2 Symmetric Cryptography and Hashes
In which of the following password protection technique, random strings of characters are added to the password before calculating their hashes?
Salting
https://en.wikipedia.org/wiki/Salt_(cryptography)
A salt is random data that is used as an additional input to a one-way function that hashes data, a password or passphrase. Salts are used to safeguard passwords in storage. Historically a password was stored in plaintext on a system, but over time additional safeguards were developed to protect a user's password against being read from the system.
A new salt is randomly generated for each password. In a typical setting, the salt and the password (or its version after key stretching) are concatenated and processed with a cryptographic hash function, and the output hash value (but not the original password) is stored with the salt in a database. Hashing allows for later authentication without keeping and therefore risking exposure of the plaintext password in the event that the authentication data store is compromised.
Salts defend against a pre-computed hash attack, e.g. rainbow tables.Since salts do not have to be memorized by humans they can make the size of the hash table required for a successful attack prohibitively large without placing a burden on the users. Since salts are different in each case, they also protect commonly used passwords, or those users who use the same password on several sites, by making all salted hash instances for the same password different from each other.
Question 7 Domain 2 Symmetric Cryptography and Hashes
RFC 1321 describes what hash?
MD5
https://en.wikipedia.org/wiki/MD5
MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, and was specified in 1992 as RFC 1321.
Question 8 Domain 4 Applications of Cryptography
Developed by Netscape and has been replaced by TLS. It was the preferred method used with secure websites.
SSL
https://en.wikipedia.org/wiki/Transport_Layer_Security
Transport Layer Security (TLS), and its now-deprecated predecessor, Secure Sockets Layer (SSL), are cryptographic protocols designed to provide communications security over a computer network. Several versions of the protocols find widespread use in applications such as web browsing, email, instant messaging, and voice over IP (VoIP). Websites can use TLS to secure all communications between their servers and web browsers.
Netscape developed the original SSL protocols, and Taher Elgamal, chief scientist at Netscape Communications from 1995 to 1998, has been described as the 'father of SSL'. SSL version 1.0 was never publicly released because of serious security flaws in the protocol. Version 2.0, released in February 1995, contained a number of security flaws which necessitated the design of version 3.0. Released in 1996, SSL version 3.0 represented a complete redesign of the protocol produced by Paul Kocher working with Netscape engineers Phil Karlton and Alan Freier, with a reference implementation by Christopher Allen and Tim Dierks of Consensus Development.
Incorrect answers:
CRL - a list of every certificate that has been revoked.
VPN - A virtual private network (VPN) extends a private network across a public network and enables users to send and receive data across shared or public networks as if their computing devices were directly connected to the private network. Applications running across a VPN may therefore benefit from the functionality, security, and management of the private network. Encryption is a common, although not an inherent, part of a VPN connection
OCSP - The Online Certificate Status Protocol (OCSP) is an Internet protocol used for obtaining the revocation status of an X.509 digital certificate. It is described in RFC 6960 and is on the Internet standards track. It was created as an alternative to certificate revocation lists (CRL), specifically addressing certain problems associated with using CRLs in a public key infrastructure (PKI).
What the Eccouncil 212-81 Exam Covers
Exam domains verified against the Official Eccouncil 212-81 exam guide, last checked November 2026.
Domain 1 Introduction and History of Cryptography
8%Trace the evolution from simple substitution ciphers like Caesar Cipher and Affine Cipher through multi-alphabet techniques such as Vigenere Cipher and Playfair Cipher. Study the Enigma Machine's role in cryptographic history and modern tools like CrypTool for hands-on cryptographic experimentation and analysis.
Sample question from this domain above Q3
Domain 2 Symmetric Cryptography and Hashes
44%Master Feistel-based ciphers like DES and 3DES alongside modern algorithms including AES, Blowfish, Serpent, and Twofish. Learn symmetric cipher modes such as ECB, CBC, and CTR, stream ciphers like RC4, and hash functions including MD5, SHA, with message authentication via MAC and HMAC.
Domain 3 Number Theory and Asymmetric Cryptography
14%Explore prime numbers, Euler's totient function, and the modulus operator as foundations for asymmetric encryption. Study cryptographic protocols including Diffie-Hellman and RSA, random number generation methods like Mersenne Twister, and elliptic curve cryptography variants.
Domain 4 Applications of Cryptography
24%Examine FIPS standards, digital certificates including X.509 specifications, and Public Key Infrastructure. Cover authentication methods such as Kerberos, encryption technologies including PGP and TLS, VPN protocols like IPSec, and file encryption tools such as BitLocker and VeraCrypt.
Sample question from this domain above Q8
Domain 5 Cryptanalysis
10%Study classical techniques like frequency analysis and Kasiski examination alongside modern approaches including chosen plaintext attacks and differential cryptanalysis. Learn about rainbow tables, password cracking methods, and tools used in cryptanalytic attacks and cipher breaking.
212-81 Exam FAQ
Common questions about the exam itself
What background do I need before taking the 212-81 ECES exam?
How difficult is the 212-81 ECES exam compared to other EC-Council certifications?
Which objective area in 212-81 do candidates typically find most challenging?
How long should I study for the 212-81 ECES exam?
Can I retake the 212-81 ECES exam if I fail?
How long is the 212-81 ECES certification valid once I pass?
What job role does the 212-81 ECES certification prepare me for?
Is there an EC-Council track where 212-81 ECES fits alongside other exams?
What is the exam format for 212-81 ECES and how is it proctored?
Does the 212-81 ECES require maintenance or continuing education after I pass?
Other Eccouncil Exams
Free practice questions for more Eccouncil certification exams
