Deal of The Day! Hurry Up, Grab the Special Discount - Save 25% - Ends In 00:00:00 Coupon code: SAVE25
Welcome to Pass4Success

- Free Preparation Discussions

Eccouncil 212-81 Exam

Certification Provider: Eccouncil
Exam Name: Certified Encryption Specialist
Duration: 120 Minutes
Number of questions in our database: 199
Exam Version: Mar. 25, 2024
212-81 Exam Official Topics:
  • Topic 1: Information Theory Cryptography Concepts/ Multi-Alphabet Substitution
  • Topic 2: Introduction and History of Cryptography/ Breaking the Vigen?re Cipher
  • Topic 3: Symmetric Cryptography & Hashes/ Single Substitution Weaknesses
  • Topic 4: Symmetric Block Cipher Algorithms/ Basic Facts of the Feistel Function
  • Topic 5: International Data Encryption Algorithm (IDEA)/ History of Cryptography
  • Topic 6: Number Theory and Asymmetric Cryptography/ Advanced Encryption Standard (AES)
  • Topic 7: Propagating Cipher-Block Chaining (PCBC)/ Naor-Reingold and Mersenne Twister Pseudorandom Function
  • Topic 8: Server-based Certificate Validation Protocol/ Classification of Random Number Generator
  • Topic 9: Shiva Password Authentication Protocol (S-PAP)/ Challenge-Handshake Authentication Protocol (CHAP)
  • Topic 10: Point-to-Point Tunneling Protocol (PPTP)/ National Security Agency and Cryptography
  • Topic 11: Cracking Modern Cryptography: Ciphertext-only and Related-key Attack/ Cracking Modern Cryptography: Chosen Plaintext Attack
  • Topic 12: Steganography Implementations/ Example of Symmetric Stream Ciphers: RC4
  • Topic 13: Birthday Paradox: Probability/ Mono-Alphabet Substitution
  • Topic 14: Cracking Modern Cryptography/ Example of Symmetric Stream Ciphers: PIKE
Disscuss Eccouncil 212-81 Topics, Questions or Ask Anything Related

Currently there are no comments in this discussion, be the first to comment!

Free Eccouncil 212-81 Exam Actual Questions

The questions for 212-81 were last updated On Mar. 25, 2024

Question #1

In 2007, this wireless security algorithm was rendered useless by capturing packets and discovering the passkey in a matter of seconds. This security flaw led to a network invasion of TJ Maxx and data theft through a technique known as wardriving.

Which Algorithm is this referring to?

Reveal Solution Hide Solution
Correct Answer: A

Wired Equivalent Privacy (WEP)

https://en.wikipedia.org/wiki/Wired_Equivalent_Privacy#Weak_security

In 2007, Erik Tews, Andrei Pychkine, and Ralf-Philipp Weinmann were able to extend Klein's 2005 attack and optimize it for usage against WEP. With the new attack it is possible to recover a 104-bit WEP key with probability 50% using only 40,000 captured packets. For 60,000 available data packets, the success probability is about 80% and for 85,000 data packets about 95%. Using active techniques like deauth and ARP re-injection, 40,000 packets can be captured in less than one minute under good conditions. The actual computation takes about 3 seconds and 3 MB of main memory on a Pentium-M 1.7 GHz and can additionally be optimized for devices with slower CPUs. The same attack can be used for 40-bit keys with an even higher success probability.


Question #2

During the process of encryption and decryption, what keys are shared?

Reveal Solution Hide Solution
Correct Answer: A

Public keys

https://en.wikipedia.org/wiki/Public-key_cryptography

Public-key cryptography, or asymmetric cryptography, is a cryptographic system that uses pairs of keys: public keys, which may be disseminated widely, and private keys, which are known only to the owner. The generation of such keys depends on cryptographic algorithms based on mathematical problems to produce one-way functions. Effective security only requires keeping the private key private; the public key can be openly distributed without compromising security.

In such a system, any person can encrypt a message using the receiver's public key, but that encrypted message can only be decrypted with the receiver's private key.

Alice and Bob have two keys of their own --- just to be clear, that's four keys total. Each party has their own public key, which they share with the world, and their own private key which they well, which they keep private, of course but, more than that, which they keep as a closely guarded secret. The magic of public key cryptography is that a message encrypted with the public key can only be decrypted with the private key. Alice will encrypt her message with Bob's public key, and even though Eve knows she used Bob's public key, and even though Eve knows Bob's public key herself, she is unable to decrypt the message. Only Bob, using his secret key, can decrypt the message assuming he's kept it secret, of course.

Alice and Bob do not need to plan anything ahead of time to communicate securely: they generate their public-private key pairs independently, and happily broadcast their public keys to the world at large. Alice can rest assured that only Bob can decrypt the message she sends because she has encrypted it with his public key.


Question #3

Which of the following is used to encrypt email and create digital signatures?

Reveal Solution Hide Solution
Correct Answer: D

RSA

https://en.wikipedia.org/wiki/RSA_(cryptosystem)

RSA usefor encryption email and create digital signatures


Question #4

Which of the following is assured by the use of a hash?

Reveal Solution Hide Solution
Correct Answer: D

Integrity

https://en.wikipedia.org/wiki/Cryptographic_hash_function#Verifying_the_integrity_of_messages_and_files

An important application of secure hashes is verification of message integrity. Comparing message digests (hash digests over the message) calculated before, and after, transmission can determine whether any changes have been made to the message or file.


Question #5

During the process of encryption and decryption, what keys are shared?

Reveal Solution Hide Solution
Correct Answer: A

Public keys

https://en.wikipedia.org/wiki/Public-key_cryptography

Public-key cryptography, or asymmetric cryptography, is a cryptographic system that uses pairs of keys: public keys, which may be disseminated widely, and private keys, which are known only to the owner. The generation of such keys depends on cryptographic algorithms based on mathematical problems to produce one-way functions. Effective security only requires keeping the private key private; the public key can be openly distributed without compromising security.

In such a system, any person can encrypt a message using the receiver's public key, but that encrypted message can only be decrypted with the receiver's private key.

Alice and Bob have two keys of their own --- just to be clear, that's four keys total. Each party has their own public key, which they share with the world, and their own private key which they well, which they keep private, of course but, more than that, which they keep as a closely guarded secret. The magic of public key cryptography is that a message encrypted with the public key can only be decrypted with the private key. Alice will encrypt her message with Bob's public key, and even though Eve knows she used Bob's public key, and even though Eve knows Bob's public key herself, she is unable to decrypt the message. Only Bob, using his secret key, can decrypt the message assuming he's kept it secret, of course.

Alice and Bob do not need to plan anything ahead of time to communicate securely: they generate their public-private key pairs independently, and happily broadcast their public keys to the world at large. Alice can rest assured that only Bob can decrypt the message she sends because she has encrypted it with his public key.



Unlock all 212-81 Exam Questions with Advanced Practice Test Features:
  • Select Question Types you want
  • Set your Desired Pass Percentage
  • Allocate Time (Hours : Minutes)
  • Create Multiple Practice tests with Limited Questions
  • Customer Support
Get Full Access Now

Save Cancel