Weekend Special - 70% Discount Offer - Ends in 0d 00h 00m 00s - Coupon code: spcl70

212-81 PDF

$33

$109.99

3 Months Free Update

  • Printable Format
  • Value of Money
  • 100% Pass Assurance
  • Verified Answers
  • Researched by Industry Experts
  • Based on Real Exams Scenarios
  • 100% Real Questions

212-81 PDF + Testing Engine

$52.8

$175.99

3 Months Free Update

  • Exam Name: EC-Council Certified Encryption Specialist (ECES)
  • Last Update: Dec 8, 2024
  • Questions and Answers: 206
  • Free Real Questions Demo
  • Recommended by Industry Experts
  • Best Economical Package
  • Immediate Access

212-81 Engine

$39.6

$131.99

3 Months Free Update

  • Best Testing Engine
  • One Click installation
  • Recommended by Teachers
  • Easy to use
  • 3 Modes of Learning
  • State of Art Technology
  • 100% Real Questions included

212-81 Practice Exam Questions with Answers EC-Council Certified Encryption Specialist (ECES) Certification

Question # 6

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.

A.

VPN

B.

PGP

C.

Cryptool

D.

VeraCrypt

Full Access
Question # 7

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

A.

Caesar cipher

B.

multi-alphabet encryption

C.

Scytale

D.

Atbash

Full Access
Question # 8

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

A.

RSA

B.

MQV

C.

EC

D.

AES

Full Access
Question # 9

A symmetric Stream Cipher published by the German engineering firm Seimans in 1993. A software based stream cipher that uses a Lagged Fibonacci generator along with concepts borrowed from shrinking generator ciphers.

A.

DESX

B.

FISH

C.

Twofish

D.

IDEA

Full Access
Question # 10

If you XOR 10111000 with 10101010, what is the result?

A.

10111010

B.

10101010

C.

11101101

D.

00010010

Full Access
Question # 11

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.

A.

Cipher-block chaining (CBC)

B.

Electronic codebook (ECB)

C.

Output feedback (OFB)

D.

Cipher feedback (CFB)

Full Access
Question # 12

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.

A.

CBC-MAC

B.

CRC-MAC

C.

CRC-32

D.

CBC-32

Full Access
Question # 13

Early attempt to make substitution ciphers more robust, masks letter frequencies, plain text letters map to multiple cipher text symbols.

A.

Scytale Cipher

B.

Playfair Cipher

C.

Homophonic Substitution

D.

ADFVGX Cipher

Full Access
Question # 14

If Bob is using asymmetric cryptography and wants to send a message to Alice so that only she can decrypt it, what key should he use to encrypt the message?

A.

Alice's private key

B.

Bob's private key

C.

Alice's public key

D.

Bob's public key

Full Access
Question # 15

A transposition cipher invented 1918 by Fritz Nebel, used a 36 letter alphabet and a modified Polybius square with a single columnar transposition.

A.

ADFVGX Cipher

B.

ROT13 Cipher

C.

Book Ciphers

D.

Cipher Disk

Full Access
Question # 16

Symmetric algorithm. Designed by James Massey and Xuejia Lai. Operates on 64 bit blocks and has a 128 bit key. Consists of 8 identical transformations each round and an output transformation.

A.

IDEA

B.

RSA

C.

CAST

D.

DES

Full Access
Question # 17

What size key does Skipjack use?

A.

128 bit

B.

56 bit

C.

80 bit

D.

256 bit

Full Access
Question # 18

This algorithm was published by the German engineering firm Seimans in 1993. It is a software based stream cipher using Lagged Fibonacci generator along with a concept borrowed from the shrinking generator ciphers.

A.

RC4

B.

Blowfish

C.

Twofish

D.

FISH

Full Access
Question # 19

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

A.

IPsec Policy Agent

B.

Internet Key Exchange (IKE)

C.

Oakley

D.

IPsec driver

Full Access
Question # 20

Juanita has been assigned the task of selecting email encryption for the staff of the insurance company she works for. The various employees often use diverse email clients. Which of the following methods is available as an add-in for most email clients?

A.

Caesar cipher

B.

RSA

C.

PGP

D.

DES

Full Access
Question # 21

Nicholas is working at a bank in Germany. He is looking at German standards for pseudo random number generators. He wants a good PRNG for generating symmetric keys. The German Federal Office for Information Security (BSI) has established four criteria for quality of random number generators. Which ones can be used for cryptography?

A.

K4

B.

K5

C.

K3

D.

K2

E.

K1

Full Access
Question # 22

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

A.

Blowfish

B.

DESX

C.

3DES

D.

AES

Full Access
Question # 23

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

A.

Requires a key

B.

One-way

C.

Fixed length output

D.

Symmetric

E.

Fast

Full Access
Question # 24

____________cryptography uses one key to encrypt a message and a different key to decrypt it.

A.

Secure

B.

Asymmetric

C.

Stream

D.

Symmetric

Full Access
Question # 25

Widely used, particularly with Microsoft operating systems. Created by MIT and derives its name from the mythical three headed dog. The is a great deal of verification for the tickets and the tickets expire quickly. Client authenticates to the Authentication Server once using a long term shared secret and receives back a Ticket-Granting Server. Client can reuse this ticket to get additional tickets without reusing the shared secret. These tickets are used to prove authentication to the Service Server.

A.

Diffie-Hellman

B.

Yarrow

C.

Kerberos

D.

ElGamal

Full Access
Question # 26

The most widely used asymmetric encryption algorithm is what?

A.

Vigenere

B.

Caesar Cipher

C.

RSA

D.

DES

Full Access
Question # 27

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?

A.

Complete diffusion

B.

Complete scrambling

C.

Complete confusion

D.

Complete avalanche

Full Access
Question # 28

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)

A.

Encrypt mode

B.

Transport mode

C.

Tunnel mode

D.

Decrypt mode

Full Access
Question # 29

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.

A.

Fibonacci Numbers

B.

Co-prime Numbers

C.

Even Numbers

D.

Mersenne Primes

Full Access
Question # 30

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

A.

Chosen plaintext

B.

Differential cryptanalysis

C.

Known-plaintext attack

D.

Kasiski examination

Full Access
Question # 31

How many qubits are needed to break RSA?

A.

1000

B.

2000

C.

4000

D.

100

Full Access
Question # 32

The art and science of writing hidden messages so that no one suspects the existence of the message, a type of security through obscurity. Message can be hidden in picture or audio file for example. Uses least significant bits in a file to store data.

A.

Steganography

B.

Cryptosystem

C.

Avalanche effect

D.

Key Schedule

Full Access
Question # 33

Which of the following is a fundamental principle of cryptography that holds that the algorithm can be publicly disclosed without damaging security?

A.

Vigenere's principle

B.

Shamir's principle

C.

Kerkchoff's principle

D.

Babbage's principle

Full Access
Question # 34

Numbers that have no factors in common with another.

A.

Fibonacci Numbers

B.

Even Numbers

C.

Co-prime numbers

D.

Mersenne Primes

Full Access
Question # 35

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

A.

SHA1

B.

SHA-256

C.

RSA

D.

MD5

Full Access
Question # 36

Which one of the following best describes a process that splits the block of plaintext into two separate blocks, then applies the round function to one half, and finally swaps the two halves?

A.

Block ciphers

B.

Symmetric cryptography

C.

Feistel cipher

D.

Substitution cipher

Full Access
Question # 37

How did the ATBASH cipher work?

A.

By substituting each letter for the letter from the opposite end of the alphabet (i.e. A becomes Z, B becomes Y, etc.)

B.

By rotating text a given number of spaces

C.

By Multi alphabet substitution

D.

By shifting each letter a certain number of spaces

Full Access
Question # 38

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

A.

DES

B.

SHA1

C.

AES

D.

RSA

Full Access
Question # 39

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.

A.

SHA-256

B.

FORK-256

C.

SHA-1

D.

RSA

Full Access
Question # 40

A method for cracking modern cryptography. The attacker obtains the cipher texts corresponding to a set of plain texts of own choosing. Allows the attacker to attempt to derive the key. Difficult but not impossible.

A.

Chosen Plaintext Attack

B.

Steganography

C.

Rainbow Tables

D.

Transposition

Full Access
Question # 41

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

A.

Mersenne's number

B.

Fermat's number

C.

Euler's totient

D.

Fermat's prime

Full Access
Question # 42

What is a salt?

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

Full Access
Question # 43

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.

A.

Keccak

B.

MD5

C.

SHA-1

D.

TIGER

Full Access
Question # 44

What does the OCSP protocol provide?

A.

Revoked certificates

B.

Hashing

C.

VPN connectivity

D.

Encryption

Full Access
Question # 45

In IPSec, if the VPN is a gateway-gateway or a host-gateway, then which one of the following is true?

A.

IPSec does not involve gateways

B.

Only transport mode can be used

C.

Encapsulating Security Payload (ESP) authentication must be used

D.

Only the tunnel mode can be used

Full Access
Question # 46

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

A.

Key Schedule

B.

Feistel Network

C.

SHA-2

D.

Diffie-Helman

Full Access
Question # 47

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?

A.

WEP

B.

WPA

C.

WPA2

D.

TKIP

Full Access
Question # 48

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

A.

Blum Blum Shub

B.

Elliptic Curve

C.

Menezes-Qu-Vanstone

D.

Euler's totient

Full Access
Question # 49

Cryptographic hashes are often used for message integrity and password storage. It is important to understand the common properties of all cryptographic hashes. What is not true about a hash?

A.

Few collisions

B.

Reversible

C.

Variable length input

D.

Fixed length output

Full Access
Question # 50

The time and effort required to break a security measure.

A.

Session Key

B.

Work factor

C.

Non-repudiation

D.

Payload

Full Access
Question # 51

In a Feistel cipher, the two halves of the block are swapped in each round. What does this provide?

A.

Diffusion

B.

Confusion

C.

Avalanche

D.

Substitution

Full Access
Question # 52

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?

A.

Rainbow table

B.

Frequency analysis

C.

Brute force

D.

Kasiski

Full Access
Question # 53

Original, unencrypted information is referred to as ____.

A.

text

B.

plaintext

C.

ciphertext

D.

cleartext

Full Access
Question # 54

RFC 1321 describes what hash?

A.

RIPEMD

B.

GOST

C.

SHA1

D.

MD5

Full Access
Question # 55

What is the formula m^e %n related to?

A.

Encrypting with EC

B.

Decrypting with RSA

C.

Generating Mersenne primes

D.

Encrypting with RSA

Full Access
Question # 56

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

A.

CA

B.

CR

C.

KDC

D.

CBC

Full Access
Question # 57

What size block does FORK256 use?

A.

64

B.

512

C.

256

D.

128

Full Access
Question # 58

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

A.

RSA

B.

AES

C.

RC4

D.

SHA-1

Full Access
Question # 59

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.

A.

Substitution

B.

Avalanche

C.

Confusion

D.

Diffusion

Full Access
Question # 60

Which of the following equations is related to EC?

A.

P = Cd%n

B.

Me%n

C.

y^2 = x^3 + Ax + B

D.

Let m = (p-1)(q-1)

Full Access
Question # 61

Why is quantum computing a threat to RSA?

A.

The processing speed will brute force algorithms

B.

Quantum computers can solve the discrete logarithm problem

C.

Quantum computers can solve the birthday paradox

D.

Quantum computers can factor large integers in polynomial time

Full Access