1. Home
  2. Eccouncil
  3. 212-81 ECES Dumps

Eliminate Risk of Failure with Eccouncil 212-81 Exam Dumps

Schedule your time wisely to provide yourself sufficient time each day to prepare for the Eccouncil 212-81 exam. Make time each day to study in a quiet place, as you'll need to thoroughly cover the material for the Certified Encryption Specialist exam. Our actual Certified Encryption Specialist exam dumps help you in your preparation. Prepare for the Eccouncil 212-81 exam with our 212-81 dumps every day if you want to succeed on your first try.

All Study Materials

Instant Downloads

24/7 costomer support

Satisfaction Guaranteed

Q1.

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

Answer: A

See the explanation below.

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.


Q2.

You are explaining basic mathematics to beginning cryptography students. You are covering the basic math used in RS

Answer: C

See the explanation below.

Any number only divisible by one and itself

https://en.wikipedia.org/wiki/Prime_number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 5 or 5 1, involve 5 itself. However, 4 is composite because it is a product (2 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.


Q3.

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

Answer: C

See the explanation below.

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.


Q4.

Asymmetric encryption method developed in 1984. It is used in PGP implementations and GNU Privacy Guard Software. Consists of 3 parts: key generator, encryption algorithm, and decryption algorithm.

Answer: D

See the explanation below.

ElGamal

https://en.wikipedia.org/wiki/ElGamal_encryption

the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie--Hellman key exchange. It was described by Taher Elgamal in 1985. ElGamal encryption is used in the free GNU Privacy Guard software, recent versions of PGP, and other cryptosystems. The Digital Signature Algorithm (DSA) is a variant of the ElGamal signature scheme, which should not be confused with ElGamal encryption.

Incorrect answers:

Tiger -is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of a Tiger hash value is 192 bits. Truncated versions (known as Tiger/128 and Tiger/160) can be used for compatibility with protocols assuming a particular hash size. Unlike the SHA-2 family, no distinguishing initialization values are defined; they are simply prefixes of the full Tiger/192 hash value.

GOST -hash function, defined in the standards GOST R 34.11-94 and GOST 34.311-95 is a 256-bit cryptographic hash function. It was initially defined in the Russian national standard GOST R 34.11-94 Information Technology -- Cryptographic Information Security -- Hash Function. The equivalent standard used by other member-states of the CIS is GOST 34.311-95.

RIPEMD -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.


Q5.

What does Output feedback (OFB) do:

Answer: C

See the explanation below.

A block cipher is converted into a stream cipher by generating a keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext

https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation#Output_feedback_(OFB)

The output feedback (OFB) mode makes a block cipher into a synchronous stream cipher. It generates keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext. Just as with other stream ciphers, flipping a bit in the ciphertext produces a flipped bit in the plaintext at the same location. This property allows many error-correcting codes to function normally even when applied before encryption.


Are You Looking for More Updated and Actual Eccouncil 212-81 Exam Questions?

If you want a more premium set of actual Eccouncil 212-81 Exam Questions then you can get them at the most affordable price. Premium Certified Encryption Specialist exam questions are based on the official syllabus of the Eccouncil 212-81 exam. They also have a high probability of coming up in the actual Certified Encryption Specialist exam.
You will also get free updates for 90 days with our premium Eccouncil 212-81 exam. If there is a change in the syllabus of Eccouncil 212-81 exam our subject matter experts always update it accordingly.