Download Latest Ec-council 212-81 Practice Exam Questions

test2022-10-05T08:54:33+00:00

Download the latest Ec-council 212-81 Practice Exam Questions for your best preparation. ECES exam is excellent for ethical hackers and penetration testing professionals as most penetration testing courses skip cryptanalysis completely. FreeTestShare Ec-council 212-81 Practice Exam Questions make your preparation process simply because they are designed to help you pass your EC-Council Certified Encryption Specialist (ECES) exam on the first try. Our Ec-council 212-81 Practice Exam Questions will take away your nervousness and help you finish the exam with a lot of important professional information.

Take a free 212-81 practice exam right now to see how prepared you are!

Page 1 of 4

1. What is the name of the attack where the attacker obtains the ciphertexts corresponding to a set of plaintexts of his own choosing?

Chosen plaintext

Differential cryptanalysis

Known-plaintext attack

Kasiski examination

2. John works as a cryptography consultant. He finds that people often misunderstand the reality of breaking a cipher .

What is the definition of breaking a cipher?

Finding any method that is more efficient than brute force

Uncovering the algorithm used

Rendering the cypher no longer useable

Decoding the key

3. _____ uses at least two different shifts, changing the shift with different letters in the plain text.

Caesar cipher

multi-alphabet encryption

Scytale

Atbash

4. Which of the following is a cryptographic protocol that allows two parties to establish a shared key over an insecure channel?

Elliptic Curve

NMD5

RSA

Diffie-Hellman

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

Public keys

Public and private keys

User passwords

Private keys

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

SHA1

MD5

FORK

RIPEMD

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

Caesar Cipher

Null Ciphers

Vigenere Cipher

Playfair Cipher

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

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

Feistel

Asymmetric cipher

Symmetric cipher

Hash

10. A technique used to increase the security of block ciphers. It consists of steps that combine the data with portions of the key (most commonly using a simple XOR) before the first round and after the last round of encryption.

Whitening

Key Exchange

Key Schedule

Key Clustering

Page 2 of 4

11. How can rainbow tables be defeated?

Lockout accounts under brute force password cracking attempts

All uppercase character passwords

Use of non-dictionary words

Password salting

12. Developed by Netscape and has been replaced by TLS. It was the preferred method used with secure websites.

OCSP

VPN

CRL

SSL

13. What is a "Collision attack" in cryptography?

Collision attacks try to break the hash into three parts to get the plaintext value

Collision attacks try to get the public key

Collision attacks try to break the hash into two parts, with the same bytes in each part to get the private key

Collision attacks try to find two inputs producing the same

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

TGS

OCSP

TGT

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

Keyed Hashing

Double Hashing

Salting

Key Stretching

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

Substitution

Whitening

Encoding

Decoding

17. 3DES can best be classified as which one of the following?

Digital signature

Symmetric algorithm

Asymmetric algorithm

Hashing algorithm

18. A cryptanalysis success where the attacker deduces the secret key.

Information Deduction

Avalanche effect

Shannon's Entropy

Total Break

19. Hash algortihm created by the Russians. Produces a fixed length output of 256bits. Input message is broken up into 256 bit blocks. If block is less than 256 bits then it is padded with 0s.

TIGER

GOST

BEAR

FORK-256

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

Fibonacci Numbers

Co-prime Numbers

Even Numbers

Mersenne Primes

Page 3 of 4

21. Which of the following is an asymmetric cipher?

RSA

AES

DES

RC4

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

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

24. Manipulating individuals so that they will divulge confidential information, rather than by breaking in or using technical cracking techniques.

Linear cryptanalysis

Replay attack

Side-channel attack

Social engineering attack

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

WEP

WPA

WPA2

TKIP

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

27. Which algorithm implements an unbalanced Feistel cipher?

Skipjack

RSA

3DES

Blowfish

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

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

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

AES

RSA

Page 4 of 4

31. John is trying to explain the basics of cryptography to a group of young, novice, security students .

Which one of the following most accurately defines encryption?

Changing a message using complex mathematics

Applying keys to a message to conceal it

Complex mathematics to conceal a message

Changing a message so it can only be easily read by the intended recipient

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

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

Total Break

Distinguishing Algorithm

Instance Deduction

Information Deduction

34. Storing private keys with a third party is referred to as what?

Key caching

Key storage

Key banking

Key escrow

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

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

Requires a key

One-way

Fixed length output

Symmetric

Fast

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

38. If you use substitution alone, what weakness is present in the resulting cipher text?

It is the same length as the original text

It is easily broken with modern computers

It maintains letter and word frequency

It is too simple