Instant Access EC-COUNCIL.212-81.v2023-03-17.q67 Actual Practice Test Engine for Free (Page 10)

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.v2023-03-17.q67 Dumps

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

Question 41

Which algorithm was U. S. Patent 5,231,668, filed on july 26, 1991, attributed to David W. Kravitz, and adopted by the U. S. government in 1993 with FIPS 186?

A.DSA
B.AES
C.RC4
D.RSA

Correct Answer: A

DSA
https://en.wikipedia.org/wiki/Digital_Signature_Algorithm
DSA is covered by U.S. Patent 5,231,668 , filed July 26, 1991 and now expired, and attributed to David
W. Kravitz, a former NSA employee. This patent was given to "The United States of America as represented by the Secretary of Commerce, Washington, D.C.", and NIST has made this patent available worldwide royalty-free. Claus
P. Schnorr claims that his U.S. Patent 4,995,082 (also now expired) covered DSA; this claim is disputed.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 42

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

Correct Answer: C

Alice's public key
https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange
In asymmetric (public key) cryptography, both communicating parties (i.e. both Alice and Bob) have two keys of their own - just to be clear, that's four keys total. Each party has their own public key, which they share with the world, and their own private key which they ... well, which they keep private, of course but, more than that, which they keep as a closely guarded secret. The magic of public key cryptography is that a message encrypted with the public key can only be decrypted with the private key. Alice will encrypt her message with Bob's public key, and even though Eve knows she used Bob's public key, and even though Eve knows Bob's public key herself, she is unable to decrypt the message. Only Bob, using his secret key, can decrypt the message ... assuming he's kept it secret, of course.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 43

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?

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

Correct Answer: A

Substitution box where input bits are replaced
https://en.wikipedia.org/wiki/S-box
In cryptography, an S-box (substitution-box) is a basic component of symmetric key algorithms which performs substitution. In block ciphers, they are typically used to obscure the relationship between the key and the ciphertext - Shannon's property of confusion.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 44

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

Correct Answer: C

Correct answer:
https://en.wikipedia.org/wiki/Feistel_cipher
Feistel cipher (also known as Luby-Rackoff block cipher) is a symmetric structure used in the construction of block ciphers, named after the German-born physicist and cryptographer Horst Feistel who did pioneering research while working for IBM (USA); it is also commonly known as a Feistel network. A large proportion of block ciphers use the scheme, including the US Data Encryption Standard, the Soviet-developed GOST and the more recent Blowfish and Twofish ciphers. In a Feistel cipher, encryption and decryption are very similar operations, and both consist of iteratively running a function called a "round function" a fixed number of times.
Incorrect answers:
Symmetric cryptography - Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext. The keys may be identical or there may be a simple transformation to go between the two keys.
Substitution cipher - is a method of encrypting by which units of plaintext are replaced with ciphertext, according to a fixed system; the "units" may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth. The receiver deciphers the text by performing the inverse substitution.
Block ciphers - block cipher is a deterministic algorithm operating on fixed-length groups of bits, called blocks. It uses an unvarying transformation, that is, it uses a symmetric key. They are specified elementary components in the design of many cryptographic protocols and are widely used to implement the encryption of large amounts of data, including data exchange protocols.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 45

Ahlen is using a set of pre-calculated hashes to attempt to derive the passwords from a Windows SAM file. What is a set of pre-calculated hashes used to derive a hashed password called?

A.Hash matrix
B.Rainbow table
C.Password table
D.Hash table

Correct Answer: B

Rainbow table
https://en.wikipedia.org/wiki/Rainbow_table
A rainbow table is a precomputed table for caching the output of cryptographic hash functions, usually for cracking password hashes. Tables are usually used in recovering a key derivation function (or credit card numbers, etc.) up to a certain length consisting of a limited set of characters. It is a practical example of a space-time tradeoff, using less computer processing time and more storage than a brute-force attack which calculates a hash on every attempt, but more processing time and less storage than a simple key derivation function with one entry per hash. Use of a key derivation that employs a salt makes this attack infeasible.

Comment: *

Name: *

Email: *

Verification: *

insert code

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

[×]

Download PDF File

Enter your email address to download EC-COUNCIL.212-81.v2023-03-17.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