212-81 Premium Files Updated Aug-2024 Practice Valid Exam Dumps Question
Practice with 212-81 Dumps for ECES Certified Exam Questions & Answer
EC-COUNCIL 212-81 (Certified Encryption Specialist) Certification Exam is a highly esteemed certification in the field of cybersecurity. Certified Encryption Specialist certification is designed to validate the skills and knowledge of professionals who have expertise in encryption methodologies and technologies. 212-81 exam tests the candidate's ability to apply encryption strategies, tools, and techniques to secure data and information against unauthorized access and theft.
The 212-81 exam assesses the knowledge and skills of candidates in a variety of areas related to encryption, including symmetric and asymmetric key cryptography, digital signatures, public key infrastructure (PKI), and secure communication protocols. 212-81 exam also covers topics such as cryptographic attacks, key management, and regulatory compliance.
EC-COUNCIL 212-81 certification exam covers a wide range of topics related to encryption, such as cryptography, key management, symmetric and asymmetric encryption, digital signatures, and more. 212-81 exam is designed to test the candidate's ability to implement and maintain encryption technologies across different platforms, whether it's on-premise, cloud-based, or hybrid environments. Certified Encryption Specialist certification also covers compliance and regulatory requirements, making it a valuable certification for professionals working in industries such as healthcare, finance, and government.
NEW QUESTION # 14
Which of the following areas is considered a strength of symmetric key cryptography when compared with asymmetric algorithms?
- A. Key distribution
- B. Security
- C. Scalability
- D. Speed
Answer: D
Explanation:
Speed
Symmetric key systems are considerably faster than asymmetric key systems but have issues with proper key distribution, controlling keys as more users need to communicate, and cannot provide non-repudiation or authenticity.
NEW QUESTION # 15
Which of the following is required for a hash?
- A. Must use SALT
- B. Minimum key length
- C. Not reversible
- D. Not vulnerable to a brute force attack
- E. Variable length input, fixed length output
- F. Few collisions
Answer: C,E
Explanation:
Correct answers: Variable length input, fixed length output and Not reversible
https://en.wikipedia.org/wiki/Hash_function
A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing.
NEW QUESTION # 16
An attack that is particularly successful against block ciphers based on substitution-permutation networks. For a block size b, holds b-k bits constant and runs the other k through all 2k possibilities. For k=1, this is just deferential cryptanalysis, but with k>1 it is a new technique.
- A. Integral Cryptanalysis
- B. Differential Cryptanalysis
- C. Chosen Plaintext Attack
- D. Linear Cryptanalysis
Answer: A
Explanation:
Integral Cryptanalysis
https://en.wikipedia.org/wiki/Integral_cryptanalysis
Integral cryptanalysis is a cryptanalytic attack that is particularly applicable to block ciphers based on substitution-permutation networks. It was originally designed by Lars Knudsen as a dedicated attack against Square, so it is commonly known as the Square attack. It was also extended to a few other ciphers related to Square: CRYPTON, Rijndael, and SHARK. Stefan Lucks generalized the attack to what he called a saturation attack and used it to attack Twofish, which is not at all similar to Square, having a radically different Feistel network structure. Forms of integral cryptanalysis have since been applied to a variety of ciphers, including Hierocrypt, IDEA, Camellia, Skipjack, MISTY1, MISTY2, SAFER++, KHAZAD, and FOX (now called IDEA NXT).
Incorrect answers:
Chosen Plaintext Attack - is an attack model for cryptanalysis which presumes that the attacker can obtain the ciphertexts for arbitrary plaintexts. The goal of the attack is to gain information that reduces the security of the encryption scheme.
Linear Cryptanalysis - is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have been developed for block ciphers and stream ciphers. Linear cryptanalysis is one of the two most widely used attacks on block ciphers.
Differential Cryptanalysis - is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information input can affect the resultant difference at the output. In the case of a block cipher, it refers to a set of techniques for tracing differences through the network of transformation, discovering where the cipher exhibits non-random behavior, and exploiting such properties to recover the secret key (cryptography key).
NEW QUESTION # 17
The reverse process from encoding - converting the encoded message back into its plaintext format.
- A. Substitution
- B. Whitening
- C. Decoding
- D. Encoding
Answer: C
Explanation:
Decoding
Decoding - reverse process from encoding,converting the encoded message back into its plaintext format.
NEW QUESTION # 18
The most widely used asymmetric encryption algorithm is what?
- A. DES
- B. Vigenere
- C. Caesar Cipher
- D. RSA
Answer: D
Explanation:
RSA
The RSA encryption algorithm is one of the most widely used public key encryption algorithms that have ever been invented. It was created by the three scientists Ronald Rivest, Adi Shamir, and Leonard Adleman in 1977, and today it is increasingly being used in the network area.
Incorrect answers:
Caesar Cipher - Monoalphabetic cipher where letters are shifted one or more letters in either direction. The method is named after Julius Caesar, who used it in his private correspondence.
Vigenere - Multi alphabet cipher Invented by Giovan Battista Bellaso in middle 1553. Vigenere created a stronger version of the cipher. Combining/Weaving Caesar cipher. Not cracked until late 1800s. Widely used from 16th century to early 20th century. It is a cipher square with A to Z across all the columns and rows. You then use a keyword to encrypt the message DES - The Data Encryption Standard is a symmetric-key algorithm for the encryption of digital data.
NEW QUESTION # 19
A _____ is a function is not reversible.
- A. Stream cipher
- B. Asymmetric cipher
- C. Block Cipher
- D. Hash
Answer: D
Explanation:
Hash
https://en.wikipedia.org/wiki/Hash_function
Hash functions are irreversible. This is actually required for them to fulfill their function of determining whether someone possesses an uncorrupted copy of the hashed data. This brings susceptibility to brute force attacks, which are quite powerful these days, particularly against MD5.
NEW QUESTION # 20
Original, unencrypted information is referred to as ____.
- A. plaintext
- B. text
- C. ciphertext
- D. cleartext
Answer: A
Explanation:
plaintext
https://en.wikipedia.org/wiki/Plaintext
In cryptography, plaintext usually means unencrypted information pending input into cryptographic algorithms, usually encryption algorithms. Cleartext usually refers to data that is transmitted or stored unencrypted ("in clear").
NEW QUESTION # 21
Message hidden in unrelated text. Sender and receiver have pre-arranged to use a pattern to remove certain letters from the message which leaves only the true message behind.
- A. Null Ciphers
- B. Playfair Cipher
- C. Vigenere Cipher
- D. Caesar Cipher
Answer: A
Explanation:
Null Ciphers
https://en.wikipedia.org/wiki/Null_cipher
A null cipher, also known as concealment cipher, is an ancient form of encryption where the plaintext is mixed with a large amount of non-cipher material. Today it is regarded as a simple form of steganography, which can be used to hide ciphertext.
Incorrect answers:
Caesar Cipher - Monoalphabetic cipher where letters are shifted one or more letters in either direction. The method is named after Julius Caesar, who used it in his private correspondence.
Vigenère - method of encrypting alphabetic text by using a series of interwoven Caesar ciphers, based on the letters of a keyword. It employs a form of polyalphabetic substitution.
Playfair Cipher - manual symmetric encryption technique and was the first literal digram substitution cipher. The scheme was invented in 1854 by Charles Wheatstone, but bears the name of Lord Playfair for promoting its use.
NEW QUESTION # 22
What is a "Collision attack" in cryptography?
- A. Collision attacks try to break the hash into three parts to get the plaintext value
- B. Collision attacks try to get the public key
- C. Collision attacks try to find two inputs producing the same
- D. Collision attacks try to break the hash into two parts, with the same bytes in each part to get the private key
Answer: C
Explanation:
Collision attacks try to find two inputs producing the same
https://en.wikipedia.org/wiki/Collision_attack
A collision attack on a cryptographic hash tries to find two inputs producing the same hash value, i.e. a hash collision. This is in contrast to a preimage attack where a specific target hash value is specified.
NEW QUESTION # 23
Which of the following is used to encrypt email and create digital signatures?
- A. DES
- B. AES
- C. SHA1
- D. RSA
Answer: D
Explanation:
RSA
https://en.wikipedia.org/wiki/RSA_(cryptosystem)
RSA use for encryption email and create digital signatures
NEW QUESTION # 24
Which of the following is not a key size used by AES?
- A. 128 bits
- B. 256 bits
- C. 512 b
- D. 192 bits
Answer: C
Explanation:
512 bits
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
AES is a subset of the Rijndael block cipher developed by two Belgian cryptographers, Vincent Rijmen and Joan Daemen, who submitted a proposal to NIST during the AES selection process. Rijndael is a family of ciphers with different key and block sizes. For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits.
NEW QUESTION # 25
The time and effort required to break a security measure.
- A. Work factor
- B. Non-repudiation
- C. Payload
- D. Session Key
Answer: A
Explanation:
Work factor
Work factor - the time and effort required to break a security measure.
Incorrect answers:
Non-repudiation - involves associating actions or changes with a unique individual.
Session Key - is a single-use symmetric key used for encrypting all messages in one communication session. A closely related term is content encryption key (CEK), traffic encryption key (TEK), or multicast key which refers to any key used for encrypting messages, contrary to other uses like encrypting other keys (key encryption key (KEK) or key wrapping key).
Payload - is the part of transmitted data that is the actual intended message. Headers and metadata are sent only to enable payload delivery.
NEW QUESTION # 26
Which algorithm was U. S. Patent 5,231,668, filed on july 26, 1991, attributed to David W. Kravitz, and adopted by the U. S. government in 1993 with FIPS 186?
- A. AES
- B. DSA
- C. RC4
- D. RSA
Answer: B
Explanation:
DSA
https://en.wikipedia.org/wiki/Digital_Signature_Algorithm
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. This patent was given to "The United States of America as represented by the Secretary of Commerce, Washington, D.C.", and NIST has made this patent available worldwide royalty-free. Claus
P. Schnorr claims that his U.S. Patent 4,995,082 (also now expired) covered DSA; this claim is disputed.
NEW QUESTION # 27
If the round function is a cryptographically secure pseudorandom function, then ___rounds is sufficient to make it a "strong" pseudorandom permutation.
- A. 0
- B. 1
- C. 2
- D. 3
Answer: D
Explanation:
4
https://en.wikipedia.org/wiki/Feistel_cipher
Michael Luby and Charles Rackoff analyzed the Feistel cipher construction, and proved that if the round function is a cryptographically secure pseudorandom function, with Ki used as the seed, then 3 rounds are sufficient to make the block cipher a pseudorandom permutation, while 4 rounds are sufficient to make it a "strong" pseudorandom permutation (which means that it remains pseudorandom even to an adversary who gets oracle access to its inverse permutation). Because of this very important result of Luby and Rackoff, Feistel ciphers are sometimes called Luby-Rackoff block ciphers.
NEW QUESTION # 28
Ferris has been assigned the task of selecting security for his company's wireless network. It is important that he pick the strongest form of wireless security. Which one of the following is the strongest wireless security?
- A. WPA2
- B. WEP
- C. WPA
- D. TKIP
Answer: A
Explanation:
WPA2
https://en.wikipedia.org/wiki/Wi-Fi_Protected_Access
WPA (sometimes referred to as the draft IEEE 802.11i standard) became available in 2003. The Wi-Fi Alliance intended it as an intermediate measure in anticipation of the availability of the more secure and complex WPA2, which became available in 2004 and is a common shorthand for the full IEEE 802.11i (or IEEE 802.11i-2004) standard.
NEW QUESTION # 29
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.
- A. Mersenne Primes
- B. Even Numbers
- C. Fibonacci Numbers
- D. Co-prime Numbers
Answer: A
Explanation:
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.
NEW QUESTION # 30
A 160-bit hash algorithm developed by Hans Dobbertin, Antoon Bosselaers, and Bart Preneel for which there are 128, 256 and 320-bit versions is called what?
- A. MD5
- B. SHA1
- C. FORK
- D. RIPEMD
Answer: D
Explanation:
RIPEMD
https://en.wikipedia.org/wiki/RIPEMD
RIPEMD (RIPE Message Digest) is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). There are five functions in the family: RIPEMD, RIPEMD-128, RIPEMD-160, RIPEMD-256, and RIPEMD-320, of which RIPEMD-160 is the most common.
The original RIPEMD, as well as RIPEMD-128, is not considered secure because 128-bit result is too small and also (for the original RIPEMD) because of design weaknesses. The 256- and 320-bit versions of RIPEMD provide the same level of security as RIPEMD-128 and RIPEMD-160, respectively; they are designed for applications where the security level is sufficient but longer hash result is necessary.
NEW QUESTION # 31
What is the formula m^e %n related to?
- A. Generating Mersenne primes
- B. Encrypting with EC
- C. Decrypting with RSA
- D. Encrypting with RSA
Answer: D
Explanation:
Encrypting with RSA
https://en.wikipedia.org/wiki/RSA_(cryptosystem)
RSA Encrypting a message m (number) with the public key (n, e) is calculated:
M' := m^e %n
Incorrect answers:
Decrypting with RSA:
M'' := m^d %n
Generation Mersenne primes:
Mn = 2^n - 1
Encrypting with Elliptic Curve (EC):
y^2 = x^3 + ax + b
NEW QUESTION # 32
What does the OCSP protocol provide?
- A. Revoked certificates
- B. Hashing
- C. VPN connectivity
- D. Encryption
Answer: A
Explanation:
Revoked certificates
https://en.wikipedia.org/wiki/Online_Certificate_Status_Protocol
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). Messages communicated via OCSP are encoded in ASN.1 and are usually communicated over HTTP. The "request/response" nature of these messages leads to OCSP servers being termed OCSP responders.
NEW QUESTION # 33
You are explaining the details of the AES algorithm to cryptography students. You are discussing the derivation of the round keys from the shared symmetric key. The portion of AES where round keys are derived from the cipher key using Rijndael's key schedule is called what?
- A. The round key phase
- B. The key expansion phase
- C. The bit shifting phase
- D. The initial round
Answer: B
Explanation:
The key expansion phase
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
KeyExpansion - round keys are derived from the cipher key using the AES key schedule. AES requires a separate 128-bit round key block for each round plus one more.
NEW QUESTION # 34
Which one of the following is an algorithm that uses variable length key from 1 to 256 bytes, which constitutes a state table that is used for subsequent generation of pseudorandom bytes and then a pseudorandom string of bits, which is XORed with the plaintext to produce the ciphertext?
- A. PIKE
- B. RC4
- C. Blowfish
- D. Twofish
Answer: B
Explanation:
RC4
https://en.wikipedia.org/wiki/RC4
RC4 (Rivest Cipher 4 also known as ARC4 or ARCFOUR meaning Alleged RC4, see below) is a stream cipher. While it is remarkable for its simplicity and speed in software, multiple vulnerabilities have been discovered in RC4, rendering it insecure. It is especially vulnerable when the beginning of the output keystream is not discarded, or when nonrandom or related keys are used. Particularly problematic uses of RC4 have led to very insecure protocols such as WEP.
The key-scheduling algorithm is used to initialize the permutation in the array "S". "keylength" is defined as the number of bytes in the key and can be in the range 1 ≤ keylength ≤ 256, typically between 5 and 16, corresponding to a key length of 40 - 128 bits. First, the array "S" is initialized to the identity permutation. S is then processed for 256 iterations in a similar way to the main PRGA, but also mixes in bytes of the key at the same time.
Incorrect answers:
Blowfish - has a 64-bit block size and a variable key length from 32 bits up to 448 bits. It is a 16-round Feistel cipher and uses large key-dependent S-boxes. In structure it resembles CAST-128, which uses fixed S-boxes.
Twofish - is a symmetric key block cipher with a block size of 128 bits and key sizes up to 256 bits.
PIKE - stream cipher was invented by Ross Anderson to be a "leaner and meaner" version of FISH after he broke FISH in 1994. Its name is supposed to be a humorous allusion to the pike fish.
NEW QUESTION # 35
_____ uses at least two different shifts, changing the shift with different letters in the plain text.
- A. Caesar cipher
- B. multi-alphabet encryption
- C. Atbash
- D. Scytale
Answer: B
Explanation:
multi-alphabet encryption
https://en.wikipedia.org/wiki/Polyalphabetic_cipher
Two different shifts create two different alphabets.
For +1 and +2
Plaintext alphabet
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
2 ciphertext alphabets
B C D E F G H I J K L M N O P Q R S T U V W X Y Z A
C D E F G H I J K L M N O P Q R S T U V W X Y Z A B
Incorrect answers:
Scytale - transposition cipher
Caesar cipher - monoalphabetic cipher
Atbash - monoalphabetic cipher
NEW QUESTION # 36
......
REAL 212-81 Exam Questions With 100% Refund Guarantee : https://www.dumpstests.com/212-81-latest-test-dumps.html
Get Special Discount Offer on 212-81 Dumps PDF: https://drive.google.com/open?id=19SnsQCnoqZp2IXQIoN5Kxq-kRXlCDU6Y