Instant Access EC-COUNCIL.212-81.v2022-12-30.q67 Actual Practice Test Engine for Free (Page 9)

Welcome to DumpsDB

- Passing Exams, Dumps for Free

Request Exam Contact

Home
Popular Exams
- Oracle
- Fortinet
- Juniper
- Microsoft
- Cisco
- Citrix
- CompTIA
- VMware
- SAP
- EMC
- PMI
- HP
- Salesforce
View All Exams
New Dumps
Upload

Oracle
Fortinet
Juniper
Microsoft
Cisco
Citrix
CompTIA
VMware
SAP
EMC
PMI
HP
Salesforce

Home
EC-COUNCIL Certification
212-81 Exam
EC-COUNCIL.212-81.v2022-12-30.q67 Dumps

««
«
…
4
5
6
7
8
9
10
11
12
13
…
»
»»

Question 36

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.

A.Whitening
B.Key Exchange
C.Key Schedule
D.Key Clustering

Correct Answer: A

Whitening
https://en.wikipedia.org/wiki/Key_whitening
In cryptography, key whitening is a technique intended to increase the security of an iterated block cipher. It consists of steps that combine the data with portions of the key.
The most common form of key whitening is xor-encrypt-xor -- using a simple XOR before the first round and after the last round of encryption.
The first block cipher to use a form of key whitening is DES-X, which simply uses two extra 64-bit keys for whitening, beyond the normal 56-bit key of DES. This is intended to increase the complexity of a brute force attack, increasing the effective size of the key without major changes in the algorithm. DES-X's inventor, Ron Rivest, named the technique whitening.
Incorrect answers:
Key Clustering - different encryption keys generated the same ciphertext from the same plaintext message.
Key Schedule - an algorithm for the key that calculates the subkeys for each round that the encryption goes through.
Key Exchange - a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of a cryptographic algorithm.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 37

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

Correct Answer: C

Menezes-Qu-Vanstone
https://en.wikipedia.org/wiki/MQV
MQV (Menezes-Qu-Vanstone) is an authenticated protocol for key agreement based on the Diffie-Hellman scheme. Like other authenticated Diffie-Hellman schemes, MQV provides protection against an active attacker. The protocol can be modified to work in an arbitrary finite group, and, in particular, elliptic curve groups, where it is known as elliptic curve MQV (ECMQV).
MQV was initially proposed by Alfred Menezes, Minghua Qu and Scott Vanstone in 1995. It was modified with Law and Solinas in 1998.
Incorrect answers:
Elliptic Curve - an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security.
Euler's totient - function counts the positive integers up to a given integer n that are relatively prime to n.
Blum Blum Shub - a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub that is derived from Michael
O. Rabin's one-way function.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 38

What type of encryption uses different keys to encrypt and decrypt the message?

A.Asymmetric
B.Symmetric
C.Secure
D.Private key

Correct Answer: A

Asymmetric
https://en.wikipedia.org/wiki/Public-key_cryptography
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.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 39

If the round function is a cryptographically secure pseudorandom function, then ___rounds is sufficient to make it a "strong" pseudorandom permutation.

A.15
B.16
C.3
D.4

Correct Answer: D

4
https://en.wikipedia.org/wiki/Feistel_cipher
Michael Luby and Charles Rackoff analyzed the Feistel cipher construction, and proved that if the round function is a cryptographically secure pseudorandom function, with Ki used as the seed, then 3 rounds are sufficient to make the block cipher a pseudorandom permutation, while 4 rounds are sufficient to make it a "strong" pseudorandom permutation (which means that it remains pseudorandom even to an adversary who gets oracle access to its inverse permutation). Because of this very important result of Luby and Rackoff, Feistel ciphers are sometimes called Luby-Rackoff block ciphers.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 40

Which of the following is the successor of SSL?

A.GRE
B.RSA
C.IPSec
D.TLS

Correct Answer: D

TLS
https://en.wikipedia.org/wiki/Transport_Layer_Security#History_and_development TLS 1.0 was first defined in RFC 2246 in January 1999 as an upgrade of SSL Version 3.0, and written by Christopher Allen and Tim Dierks of Consensus Development. As stated in the RFC, "the differences between this protocol and SSL 3.0 are not dramatic, but they are significant enough to preclude interoperability between TLS 1.0 and SSL 3.0". Tim Dierks later wrote that these changes, and the renaming from "SSL" to "TLS", were a face-saving gesture to Microsoft, "so it wouldn't look [like] the IETF was just rubberstamping Netscape's protocol".

Comment: *

Name: *

Email: *

Verification: *

insert code

««
«
…
4
5
6
7
8
9
10
11
12
13
…
»
»»

[×]

Download PDF File

Enter your email address to download EC-COUNCIL.212-81.v2022-12-30.q67 Dumps

Email:

We are the Largest and the most Updated website for all vendors Certification Exam materials around the world.

Using resources of we provide, we strive using dumps to strengthen the community of High level Certification professionals for free.

DMCA
About
Contact Us
Privacy Policy
Terms & Conditions

©2025 DumpsDB

www.dumpsdb.com materials do not contain actual questions and answers from Cisco's certification exams.

Web Analytics