menu
arrow_back
Quiz 2023 EC-COUNCIL 212-81: Certified Encryption Specialist–High-quality Practice Exams Free
212-81 Practice Exams Free,Reliable 212-81 Test Prep,212-81 Complete Exam Dumps,212-81 Free Sample,212-81 Latest Exam, Quiz 2023 EC-COUNCIL 212-81: Certified Encryption Specialist–High-quality Practice Exams Free

P.S. Free & New 212-81 dumps are available on Google Drive shared by Real4Prep: https://drive.google.com/open?id=1peVzLvRLsN55YIHgXQX7O64G0Ysqf1Um

It is impossible for everyone to concentrate on one thing for a long time, because as time goes by, people's attention will gradually decrease. Our 212-81 test preparation materials can teach users how to arrange their time. And our 212-81 learn materials are arranged for the user reasonable learning time, allow the user to try to avoid long time continuous use of our 212-81 Exam Questions, so that we can better let users in the most concentrated attention to efficient learning on our 212-81 training guide.

EC-COUNCIL 212-81 Exam Syllabus Topics:

TopicDetails
Topic 1
  • Shiva Password Authentication Protocol (S-PAP)
  • Challenge-Handshake Authentication Protocol (CHAP)
Topic 2
  • Propagating Cipher-Block Chaining (PCBC)
  • Naor-Reingold and Mersenne Twister Pseudorandom Function
Topic 3
  • Information Theory Cryptography Concepts
  • Multi-Alphabet Substitution
Topic 4
  • Introduction and History of Cryptography
  • Breaking the Vigenère Cipher
Topic 5
  • Point-to-Point Tunneling Protocol (PPTP)
  • National Security Agency and Cryptography
Topic 6
  • International Data Encryption Algorithm (IDEA)
  • History of Cryptography
Topic 7
  • Steganography Implementations
  • Example of Symmetric Stream Ciphers: RC4
Topic 8
  • Server-based Certificate Validation Protocol
  • Classification of Random Number Generator

>> 212-81 Practice Exams Free <<

Reliable 212-81 Test Prep - 212-81 Complete Exam Dumps

Are you still worried about your coming 212-81 exam and have no idea what to do? Are you too busy to study with all the books and other broad exam materials which will take you a long time to prapare for your exam? You can just choose to buy our 212-81 Exam Questions which have settle all these problems for you. And our pass rate of the 212-81 study materials is high as 98% to 100%. Hence they are your real ally for establishing your career pathway and get your potential attested.

EC-COUNCIL Certified Encryption Specialist Sample Questions (Q106-Q111):

NEW QUESTION # 106
If you use substitution alone, what weakness is present in the resulting cipher text?

  • A. It is the same length as the original text
  • B. It maintains letter and word frequency
  • C. It is too simple
  • D. It is easily broken with modern computers

Answer: B

Explanation:
It maintains letter and word frequency
https://en.wikipedia.org/wiki/Frequency_analysis
Frequency analysis (also known as counting letters) is the study of the frequency of letters or groups of letters in a ciphertext. The method is used as an aid to breaking classical ciphers.
Frequency analysis is based on the fact that, in any given stretch of written language, certain letters and combinations of letters occur with varying frequencies. Moreover, there is a characteristic distribution of letters that is roughly the same for almost all samples of that language. For instance, given a section of English language, E, T, A and O are the most common, while Z, Q, X and J are rare. Likewise, TH, ER, ON, and AN are the most common pairs of letters (termed bigrams or digraphs), and SS, EE, TT, and FF are the most common repeats. The nonsense phrase "ETAOIN SHRDLU" represents the 12 most frequent letters in typical English language text.
In some ciphers, such properties of the natural language plaintext are preserved in the ciphertext, and these patterns have the potential to be exploited in a ciphertext-only attack.


NEW QUESTION # 107
The concept that if one bit of data changes, the cipher text will all completely change as well.

  • A. Confusion
  • B. Avalanche
  • C. Substitution
  • D. Collision

Answer: B

Explanation:
Avalanche
https://en.wikipedia.org/wiki/Avalanche_effect
In cryptography, the avalanche effect is the desirable property of cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein if an input is changed slightly (for example, flipping a single bit), the output changes significantly (e.g., half the output bits flip). In the case of high-quality block ciphers, such a small change in either the key or the plaintext should cause a drastic change in the ciphertext. The actual term was first used by Horst Feistel, although the concept dates back to at least Shannon's diffusion.
Incorrect answers:
Confusion - Confusion means that each binary digit (bit) of the ciphertext should depend on several parts of the key, obscuring the connections between the two.
The property of confusion hides the relationship between the ciphertext and the key.
This property makes it difficult to find the key from the ciphertext and if a single bit in a key is changed, the calculation of the values of most or all of the bits in the ciphertext will be affected.
Confusion increases the ambiguity of ciphertext and it is used by both block and stream ciphers.
Substitution - method of encrypting by which units of plaintext are replaced with ciphertext, according to a fixed system; the "units" may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth. The receiver deciphers the text by performing the inverse substitution.
Collision - occurs when a hash function generates the same output for different inputs.


NEW QUESTION # 108
If the round function is a cryptographically secure pseudorandom function, then ___________ rounds is sufficient to make the block cipher a pseudorandom permutation.

  • A. 0
  • B. 1
  • C. 2
  • D. 3

Answer: A

Explanation:
3
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 # 109
Bob's password is hashed, and so is John's. Even though they used different passwords, the hash is the same. What is this called?

  • A. A mistake
  • B. Transposition
  • C. A collision
  • D. Convergence

Answer: C

Explanation:
A collision
https://en.wikipedia.org/wiki/Collision_(computer_science)
A collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest.


NEW QUESTION # 110
In which of the following password protection technique, random strings of characters are added to the password before calculating their hashes?

  • A. Key Stretching
  • B. Salting
  • C. Double Hashing
  • D. Keyed Hashing

Answer: B

Explanation:
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.


NEW QUESTION # 111
......

The 212-81 exam questions given in this desktop 212-81 Certified Encryption Specialist practice exam software are equivalent to the actual 212-81 Certified Encryption Specialist exam. The desktop EC-COUNCIL 212-81 practice exam software can be used on Window based computers. If any issue arises, the Real4Prep support team is there to fix the issue. With more than thousands of satisfied customers around the globe, you can use the EC-COUNCIL 212-81 Study Materials of Real4Prep with confidence.

Reliable 212-81 Test Prep: https://www.real4prep.com/212-81-exam.html

BTW, DOWNLOAD part of Real4Prep 212-81 dumps from Cloud Storage: https://drive.google.com/open?id=1peVzLvRLsN55YIHgXQX7O64G0Ysqf1Um

keyboard_arrow_up