212-81 EC-Council Certified Encryption Specialist (ECES) PDF Dumps - Download As The Good Learning Materials

212-81 EC-Council Certified Encryption Specialist (ECES) PDF Dumps – Download As The Good Learning Materials

Eleanor2024-10-14T15:22:37+00:00

By Eleanor EC-Council, ECES

The EC-Council Certified Encryption Specialist (ECES) program introduces professionals and students to the field of cryptography. Now, you can download the 212-81 EC-Council ECES pdf dumps as good learning materials to prepare well for the EC-Council Certified Encryption Specialist (ECES) certification exam. You can easily use the EC-Council 212-81 PDF Dumps via smartphones, laptops, and tablets. All questions and answers in the 212-81 pdf document are 100% accurate. We guarantee that you can pass the 212-81 EC-Council Certified Encryption Specialist (ECES) exam successfully.

Reading ECES 212-81 Free Dumps Demo Is Highly Recommended

Page 1 of 6

1. Which of the following are valid key sizes for AES (choose three)?

192

256

128

512

2. Which of the following algorithms uses three different keys to encrypt the plain text?

Skipjack

AES

Blowfish

3DES

3. Encryption of the same plain text with the same key results in the same cipher text. Use of an IV that is XORed with the first block of plain text solves this problem.

CFB

GOST

ECB

RC4

4. Which of the following is a protocol for exchanging keys?

AES

RSA

5. Cylinder tool. Wrap leather around to decode. The diameter is the key. Used in 7th century BC by greek poet Archilochus.

Cipher disk

Caesar cipher

Scytale

Enigma machine

6. The reverse process from encoding - converting the encoded message back into its plaintext format.

Substitution

Whitening

Encoding

Decoding

7. Hash. Created by Ronald Rivest. Replaced MD4. 128 bit output size, 512 bit block size, 32 bit word size, 64 rounds. Infamously compromised by Flame malware in 2012.

Keccak

MD5

SHA-1

TIGER

8. What is Kerchoff's principle?

A minimum of 15 rounds is needed for a Feistel cipher to be secure

Only the key needs to be secret, not the actual algorithm

Both algorithm and key should be kept secret

A minimum key size of 256 bits is necessary for security

9. 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?

PIKE

Twofish

RC4

Blowfish

10. Basic information theory is the basis for modern symmetric ciphers. Understanding the terminology of information theory is, therefore, important.

If a single change of a single bit in the plaintext causes changes in all the bits of the resulting ciphertext, what is this called?

Complete diffusion

Complete scrambling

Complete confusion

Complete avalanche

Page 2 of 6

11. 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?

The key expansion phase

The round key phase

The bit shifting phase

The initial round

12. Which of the following is generally true about key sizes?

Larger key sizes increase security

Key size is irrelevant to security

Key sizes must be more than 256 bits to be secure

Smaller key sizes increase security

13. Which of the following would be the fastest.

RSA

AES

14. In 1977 researchers and MIT described what asymmetric algorithm?

RSA

AES

15. In a Feistel cipher, the two halves of the block are swapped in each round .

What does this provide?

Diffusion

Confusion

Avalanche

Substitution

16. Protocol suite provides a method of setting up a secure channel for protected data exchange between two devices.

CLR

OCSP

TLS

IPSec

17. Which analysis type is based on the statistics of the numbers of unique colors and close-color pairs in a 24-bit image, a method that analyzes the pairs of colors created by LSB embedding?

Differential Analysis

Discrete Cosine Transform

Raw Quick Pair

Chi squared analysis

18. Original, unencrypted information is referred to as ____.

text

plaintext

ciphertext

cleartext

19. Which of the following is a type of encryption that has two different keys. One key can encrypt the message and the other key can only decrypt it?

Block cipher

Asymmetric

Symmetric

Stream cipher

20. A simple algorithm that will take the initial key and from that generate a slightly different key each round.

Key Schedule

Feistel Network

SHA-2

Diffie-Helman

Page 3 of 6

21. What is the basis for the FISH algorithm?

The Lagged Fibonacci generator

Prime number theory

Equations that describe an ellipse

The difficulty in factoring numbers

22. Which of the following is required for a hash?

Not vulnerable to a brute force attack

Few collisions

Must use SALT

Not reversible

Variable length input, fixed length output

Minimum key length

23. Which algorithm implements an unbalanced Feistel cipher?

Skipjack

RSA

3DES

Blowfish

24. When learning algorithms, such as RSA, it is important to understand the mathematics being used. In RSA, the number of positive integers less than or equal to some number is critical in key generation. The number of positive integers less than or equal to n that are coprime to n is called ______.

Mersenne's number

Fermat's number

Euler's totient

Fermat's prime

25. Which service in a PKI will vouch for the identity of an individual or company?

KDC

CBC

26. John is responsible for VPNs at his company. He is using IPSec because it has two different modes. He can choose the mode appropriate for a given situation .

What are the two modes of IPSec? (Choose two)

Encrypt mode

Transport mode

Tunnel mode

Decrypt mode

27. Which of the following areas is considered a strength of symmetric key cryptography when compared with asymmetric algorithms?

Key distribution

Security

Scalability

Speed

28. Frank is trying to break into an encrypted file… He is attempting all the possible keys that could be used for this algorithm.

Attempting to crack encryption by simply trying as many randomly generated keys as possible is referred to as what?

Rainbow table

Frequency analysis

Brute force

Kasiski

29. This is a 128 bit hash that is specified by RFC 132 1. It was designed by Ron Rivest in 1991 to replace an earlier hash function.

SHA1

SHA-256

RSA

MD5

30. A cryptanalysis success where the attacker discovers additional plain texts (or cipher texts) not previously known.

Total Break

Distinguishing Algorithm

Instance Deduction

Information Deduction

Page 4 of 6

31. Jane is looking for an algorithm to ensure message integrity .

Which of following would be an acceptable choice?

RSA

AES

RC4

SHA-1

32. DES has a key space of what?

2^128

2^192

2^64

2^56

33. A protocol for key aggreement based on Diffie-Hellman. Created in 1995. Incorporated into the public key standard IEEE P1363.

Blum Blum Shub

Elliptic Curve

Menezes-Qu-Vanstone

Euler's totient

34. Which one of the following are characteristics of a hash function? (Choose two)

Requires a key

One-way

Fixed length output

Symmetric

Fast

35. Which of the following is the standard for digital certificates?

RFC 2298

509

CRL

36. WPA2 uses AES for wireless data encryption at which of the following encryption levels?

128 bit and CRC

128 bi and TKIP

128 bit and CCMP

64 bit and CCMP

37. Collision resistance is an important property for any hashing algorithm. Joan wants to find a cryptographic hash that has strong collision resistance .

Which one of the following is the most collisionresistant?

SHA2

MD5

MD4

PIKE

38. The most common way steganography is accomplished is via which one of the following?

rsb

Isb

msb

asb

39. The 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.

Cipher-block chaining (CBC)

Electronic codebook (ECB)

Output feedback (OFB)

Cipher feedback (CFB)

40. What best describes the shifting of each letter a fixed number of spaces to the left or right?

Single substitution

Multi substitution

XOR

Bit shifting

Page 5 of 6

41. The Clipper chip is notable in the history of cryptography for many reasons. First, it was designed for civilian used secure phones. Secondly, it was designed to use a very specific symmetric cipher .

Which one of the following was originally designed to provide built-in cryptography for the Clipper chip?

Blowfish

Twofish

Skipjack

Serpent

42. You have been tasked with selecting a digital certificate standard for your company to use .

Which one of the following was an international standard for the format and information contained in a digital certificate?

509

CRL

RFC 2298

43. Juanita is attempting to hide some text into a jpeg file. Hiding messages inside another medium is referred to as which one of the following?

Cryptography

Steganalysis

Cryptology

Steganography

44. What is a variation of DES that uses a technique called Key Whitening?

Blowfish

DESX

3DES

AES

45. Which one of the following is a component of the PKI?

TGS

OCSP

TGT

46. RFC 1321 describes what hash?

RIPEMD

GOST

SHA1

MD5

47. 1. What size block does AES work on?

128

192

256

48. What does the OCSP protocol provide?

Revoked certificates

Hashing

VPN connectivity

Encryption

49. Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.

Decoding

Substitution

Transposition

Collision

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

Public keys

Public and private keys

User passwords

Private keys

Page 6 of 6

51. Which of the following acts as a verifier for the certificate authority?

Certificate Management system

Directory management system

Registration authority

Certificate authority

52. A _____ is a function that takes a variable-size input m and returns a fixed-size string.

Feistel

Asymmetric cipher

Symmetric cipher

Hash

53. Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 Xi m.

Lehmer Random Number Generator

Lagged Fibonacci Generator

Linear Congruential Generator

Blum Blum Shub

54. Which of the following is the successor of SSL?

GRE

RSA

IPSec

TLS

55. A non-secret binary vector used as the initializing input algorithm for encryption of a plaintext block sequence to increase security by introducing additional cryptographic variance.

Salt

L2TP

Nonce

56. A _________ is a digital representation of information that identifies you as a relevant entity by a trusted third party.

Digital Signature

Hash

Ownership stamp

Digest

57. Calculates the average LSB and builds a table of frequencies and Pair of Values. Performs a test on the two tables. It measures the theoretical vs. calculated population difference.

Certificate Authority

Raw Quick Pair

Chi-Square Analysis

SP network

58. Software for maintaining an on-the-fly-encrypted volume. Data is automatically encrypted right before it is saved, then decrypted right after it is loaded, all w/o user intervention.

VPN

PGP

Cryptool

VeraCrypt

212-81 EC-Council Certified Encryption Specialist (ECES) PDF Dumps – Download As The Good Learning Materials

212-81 EC-Council Certified Encryption Specialist (ECES) PDF Dumps – Download As The Good Learning Materials

Reading ECES 212-81 Free Dumps Demo Is Highly Recommended

Share this post

Author

Related Posts