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

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

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

Question 6

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 7

A type of frequency analysis used to attack polyalphabetic substitution ciphers. It's used to try to discover patterns and use that information to decrypt the cipher.

A.Kasiski Method
B.Birthday Attack
C.Information Deduction
D.Integral Cryptanalysis

Correct Answer: A

Kasiski Method
https://en.wikipedia.org/wiki/Kasiski_examination
In cryptanalysis, Kasiski examination (also referred to as Kasiski's test or Kasiski's method) is a method of attacking polyalphabetic substitution ciphers, such as the Vigenere cipher. It was first published by Friedrich Kasiski in 1863, but seems to have been independently discovered by Charles Babbage as early as 1846.
Incorrect answers:
Integral Cryptanalysis - uses lots of sets of plaintext that are similar with slight modifications. These are encrypted and then the variations are analyzed to determine if there's anything that can be zeroed in on.
Information Deduction - the attacker gains some Shannon information about plaintexts (or ciphertexts) not previously known.
Birthday Attack - cryptographic attack that exploits the mathematics behind the birthday problem in the probability theory forces collisions within hashing functions.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 8

You are studying classic ciphers. You have been examining the difference between single substitution and multi-substitution. Which one of the following is an example of a multi-alphabet cipher?

A.Rot13
B.Caesar
C.Atbash
D.Vigenere

Correct Answer: D

Vigenere
https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher
The Vigenere cipher is a method of encrypting alphabetic text by using a series of interwoven Caesar ciphers, based on the letters of a keyword. It employs a form of polyalphabetic substitution.
First described by Giovan Battista Bellaso in 1553, the cipher is easy to understand and implement, but it resisted all attempts to break it until 1863, three centuries later. This earned it the description le chiffre indechiffrable (French for 'the indecipherable cipher'). Many people have tried to implement encryption schemes that are essentially Vigenere ciphers. In 1863, Friedrich Kasiski was the first to publish a general method of deciphering Vigenere ciphers.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 9

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

Correct Answer: C

PGP
https://en.wikipedia.org/wiki/Pretty_Good_Privacy
Pretty Good Privacy (PGP) is an encryption program that provides cryptographic privacy and authentication for data communication. PGP is used for signing, encrypting, and decrypting texts, e-mails, files, directories, and whole disk partitions and to increase the security of e-mail communications. Phil Zimmermann developed PGP in 1991.

Comment: *

Name: *

Email: *

Verification: *

insert code

Question 10

Which of the following is a cryptographic protocol that allows two parties to establish a shared key over an insecure channel?

A.Elliptic Curve
B.NMD5
C.RSA
D.Diffie-Hellman

Correct Answer: D

Diffie-Hellman
https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange
Diffie-Hellman key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as originally conceptualized by Ralph Merkle and named after Whitfield Diffie and Martin Hellman. DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography.
Incorrect answers:
Elliptic Curve - Asymmetric Key Algorithm, provides encryption, digital signatures, key exchange, based on the idea of using points on a curve to define the public/private key, used in wireless devices and smart cards. The security of the Elliptic Curve cryptography is based on the fact that finding the discrete logarithm of a random elliptic curve element with respect to a publicly known base point is difficult to the point of being impractical to do so. (y2 = x3 + Ax + B) - Developed by Victor Miller and Neil Koblitz in 1985 MD5 - hash function - 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. Not collision resistant - Not Reversible - RFC 1321 RSA - is a public-key cryptosystem that is widely used for secure data transmission.

Comment: *

Name: *

Email: *

Verification: *

insert code

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

[×]

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