Instant Access EC-COUNCIL.212-81.v2023-05-30.q74 Actual Practice Test Engine for Free (Page 7)

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-05-30.q74 Dumps

««
«
…
2
3
4
5
6
7
8
9
10
11
…
»
»»

Question 26

How can rainbow tables be defeated?

A.Lockout accounts under brute force password cracking attempts
B.All uppercase character passwords
C.Use of non-dictionary words
D.Password salting

Correct Answer: D

Password salting
https://en.wikipedia.org/wiki/Salt_(cryptography)#Benefits
Salts also combat the use of hash tables and rainbow tables for cracking passwords. A hash table is a large list of pre-computed hashes for commonly used passwords. For a password file without salts, an attacker can go through each entry and look up the hashed password in the hash table or rainbow table. If the look-up is considerably faster than the hash function (which it often is), this will considerably speed up cracking the file. However, if the password file is salted, then the hash table or rainbow table would have to contain "salt . password" pre-hashed. If the salt is long enough and sufficiently random, this is very unlikely. Unsalted passwords chosen by humans tend to be vulnerable to dictionary attacks since they have to be both short and meaningful enough to be memorized. Even a small dictionary (or its hashed equivalent, a hash table) is significant help cracking the most commonly used passwords. Since salts do not have to be memorized by humans they can make the size of the rainbow table required for a successful attack prohibitively large without placing a burden on the users.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 27

Which of the following Secure Hashing Algorithm (SHA) produces a 160-bit digest from a message with a maximum length of (264-1) bits and resembles the MD5 algorithm?

A.SHA-0
B.SHA-2
C.SHA-1
D.SHA-3

Correct Answer: C

SHA-1
https://en.wikipedia.org/wiki/SHA-1
SHA-1 (Secure Hash Algorithm 1) is a cryptographic hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest - typically rendered as a hexadecimal number, 40 digits long. It was designed by the United States National Security Agency, and is a U.S. Federal Information Processing Standard.
SHA-1 produces a message digest based on principles similar to those used by Ronald
L. Rivest of MIT in the design of the MD2, MD4 and MD5 message digest algorithms, but generates a larger hash value (160 bits vs. 128 bits).

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 28

A _________ is a digital representation of information that identifies you as a relevant entity by a trusted third party.

A.Digital Signature
B.Hash
C.Ownership stamp
D.Digest

Correct Answer: A

Digital Signature
https://en.wikipedia.org/wiki/Digital_signature
A digital signature is a mathematical scheme for verifying the authenticity of digital messages or documents. A valid digital signature, where the prerequisites are satisfied, gives a recipient very strong reason to believe that the message was created by a known sender (authentication), and that the message was not altered in transit (integrity).

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 29

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

A.10111010
B.10101010
C.11101101
D.00010010

Correct Answer: D

00010010
https://en.wikipedia.org/wiki/XOR_cipher
1 0 1 1 1 0 0 0
1 0 1 0 1 0 1 0
________________
0 0 0 1 0 0 1 0

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 30

A linear congruential generator is an example of what?

A.A coprime generator
B.A prime number generator
C.A pseudo random number generator
D.A random number generator

Correct Answer: C

A pseudo random number generator
https://en.wikipedia.org/wiki/Linear_congruential_generator
A linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. The method represents one of the oldest and best-known pseudorandom number generator algorithms. The theory behind them is relatively easy to understand, and they are easily implemented and fast, especially on computer hardware which can provide modular arithmetic by storage-bit truncation.

Comment: *

Name: *

Email: *

Verification: *

insert code

««
«
…
2
3
4
5
6
7
8
9
10
11
…
»
»»

[×]

Download PDF File

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