March Sale Special Limited Time Flat 70% Discount offer - Ends in 0d 00h 00m 00s - Coupon code: 70spcl

ECCouncil 212-81 EC-Council Certified Encryption Specialist (ECES) Exam Practice Test

Page: 1 / 20
Total 199 questions

EC-Council Certified Encryption Specialist (ECES) Questions and Answers

Question 1

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

Options:

A.

Cipher disk

B.

Caesar cipher

C.

Scytale

D.

Enigma machine

Question 2

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

Options:

A.

Blum Blum Shub

B.

Elliptic Curve

C.

Menezes-Qu-Vanstone

D.

Euler's totient

Question 3

Which one of the following uses three different keys, all of the same size?

Options:

A.

3DES

B.

AES

C.

RSA

D.

DES

Question 4

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.

Options:

A.

IV

B.

Salt

C.

L2TP

D.

Nonce

Question 5

Jane is looking for an algorithm to ensure message integrity. Which of following would be an acceptable choice?

Options:

A.

RSA

B.

AES

C.

RC4

D.

SHA-1

Question 6

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.

Options:

A.

Lehmer Random Number Generator

B.

Lagged Fibonacci Generator

C.

Linear Congruential Generator

D.

Blum Blum Shub

Question 7

Which of the following is not a key size used by AES?

Options:

A.

128 bits

B.

192 bits

C.

256 bits

D.

512 b

Question 8

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.

Options:

A.

Keccak

B.

MD5

C.

SHA-1

D.

TIGER

Question 9

Which of the following encryption algorithms relies on the inability to factor large prime numbers?

Options:

A.

RSA

B.

MQV

C.

EC

D.

AES

Question 10

Denis is looking at an older system that uses DES encryption. A colleague has told him that DES is insecure due to a small key size. What is the key length used for DES?

Options:

A.

128

B.

256

C.

56

D.

64

Question 11

Which component of IPsec performs protocol-level functions that are required to encrypt and decrypt the packets?

Options:

A.

IPsec Policy Agent

B.

Internet Key Exchange (IKE)

C.

Oakley

D.

IPsec driver

Question 12

Which of the following was a multi alphabet cipher widely used from the 16th century to the early 20th century?

Options:

A.

Atbash

B.

Caesar

C.

Scytale

D.

Vigenere

Question 13

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?

Options:

A.

Changing a message using complex mathematics

B.

Applying keys to a message to conceal it

C.

Complex mathematics to conceal a message

D.

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

Question 14

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

Options:

A.

Substitution

B.

Whitening

C.

Encoding

D.

Decoding

Question 15

A cipher is defined as what

Options:

A.

The algorithm(s) needed to encrypt and decrypt a message

B.

Encrypted text

C.

The key used to encrypt a message

D.

Any algorithm used in cryptography

Question 16

Changes to one character in the plain text affect multiple characters in the cipher text, unlike in historical algorithms where each plain text character only affect one cipher text character.

Options:

A.

Substitution

B.

Avalanche

C.

Confusion

D.

Diffusion

Question 17

The greatest weakness with symmetric algorithms is _____.

Options:

A.

They are less secure than asymmetric

B.

The problem of key exchange

C.

The problem of generating keys

D.

They are slower than asymmetric

Question 18

As a network administrator, you have implemented WPA2 encryption in your corporate wireless network. The WPA2's ________ integrity check mechanism provides security against a replay attack.

Options:

A.

CBC-MAC

B.

CRC-MAC

C.

CRC-32

D.

CBC-32

Question 19

A _____ is a function is not reversible.

Options:

A.

Stream cipher

B.

Asymmetric cipher

C.

Hash

D.

Block Cipher

Question 20

What is a salt?

Options:

A.

Key whitening

B.

Random bits intermixed with a symmetric cipher to increase randomness and make it more secure

C.

Key rotation

D.

Random bits intermixed with a hash to increase randomness and reduce collisions

Question 21

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.

Options:

A.

Certificate Authority

B.

Raw Quick Pair

C.

Chi-Square Analysis

D.

SP network

Question 22

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

Options:

A.

rsb

B.

Isb

C.

msb

D.

asb

Question 23

Fred is using an operating system that stores all passwords as an MD5 hash. What size is an MD5 message digest (hash)?

Options:

A.

160

B.

512

C.

256

D.

128

Question 24

What must occur in order for a cipher to be considered ‘broken’?

Options:

A.

Uncovering the algorithm used

B.

Decoding the key

C.

Finding any method that is more efficient than brute force

D.

Rendering the cipher no longer useable

Question 25

In steganography, ________ is the data to be covertly communicated (in other words, it is the message you wish to hide).

Options:

A.

Carrier

B.

Signal

C.

Payload

D.

Channel

Question 26

Created in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT. Most widely used public key cryptography algorithm. Based on relationships with prime numbers. This algorithm is secure because it is difficult to factor a large integer composed of two or more large prime factors.

Options:

A.

PKI

B.

DES

C.

RSA

D.

Diffie-Helmann

Question 27

This hash function uses 512-bit blocks and implements preset constants that change after each repetition. Each block is hashed into a 256-bit block through four branches that divides each 512 block into sixteen 32-bit words that are further encrypted and rearranged.

Options:

A.

SHA-256

B.

FORK-256

C.

SHA-1

D.

RSA

Question 28

Modern symmetric ciphers all make use of one or more s-boxes. Both Feistel and non-Feistel ciphers use these s-boxes. What is an s-box?

Options:

A.

A substitution box where input bits are replaced

B.

A black box for the algorithm implementation

C.

A shifting box where input bits are shifted

D.

Another name for the round function

Question 29

What size block does FORK256 use?

Options:

A.

64

B.

512

C.

256

D.

128

Page: 1 / 20
Total 199 questions