EC-COUNCIL EC-COUNCIL Certifications 212-81 Questions & Answers

• Question 31:

  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

  Correct Answer: D

  VeraCrypt https://en.wikipedia.org/wiki/VeraCrypt VeraCrypt is a source-available freeware utility used for on-the-fly encryption (OTFE). It can create a virtual encrypted disk within a file or encrypt a partition or (in Windows) the entire storage device with pre-boot authentication.

• Question 32:

  Calculates the average LSB and builds a table of frequencies and Pair of Values. Performs a test on the two tables. It measures the theoretical vs. calculated population difference.

  A. Certificate Authority

  B. Raw Quick Pair

  C. Chi-Square Analysis

  D. SP network

  Correct Answer: C

  Chi-Square Analysis https://en.wikipedia.org/wiki/Chi-squared_test A chi-squared test, is a statistical hypothesis test that is valid to perform when the test statistic is chi-squared distributed under the null hypothesis, specifically Pearson's chi- squared test and variants thereof. Pearson's chi-squared test is used to determine whether there is a statistically significant difference between the expected frequencies and the observed frequencies in one or more categories of a contingency table. In cryptanalysis, the chi-squared test is used to compare the distribution of plaintext and (possibly) decrypted ciphertext. The lowest value of the test means that the decryption was successful with high probability. This method can be generalized for solving modern cryptographic problems.

• Question 33:

  Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.

  A. Decoding

  B. Substitution

  C. Transposition

  D. Collision

  Correct Answer: B

  Substitution

  https://en.wikipedia.org/wiki/Substitution_cipher

  In cryptography, a 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.

• Question 34:

  Which of the following acts as a verifier for the certificate authority?

  A. Certificate Management system

  B. Directory management system

  C. Registration authority

  D. Certificate authority

  Correct Answer: C

  Registration authority https://en.wikipedia.org/wiki/Registration_authority Registration authorities exist for many standards organizations, such as ANNA (Association of National Numbering Agencies for ISIN), the Object Management Group, W3C, IEEE and others. In general, registration authorities all perform a similar function, in promoting the use of a particular standard through facilitating its use. This may be by applying the standard, where appropriate, or by verifying that a particular application satisfies the standard's tenants. Maintenance agencies, in contrast, may change an element in a standard based on set rules ?such as the creation or change of a currency code when a currency is created or revalued (i.e. TRL to TRY for Turkish lira). The Object Management Group has an additional concept of certified provider, which is deemed an entity permitted to perform some functions on behalf of the registration authority, under specific processes and procedures documented within the standard for such a role.

• Question 35:

  Original, unencrypted information is referred to as ____.

  A. text

  B. plaintext

  C. ciphertext

  D. cleartext

  Correct Answer: B

  plaintext https://en.wikipedia.org/wiki/Plaintext In cryptography, plaintext usually means unencrypted information pending input into cryptographic algorithms, usually encryption algorithms. Cleartext usually refers to data that is transmitted or stored unencrypted ("in clear").

• Question 36:

  What is the basis for the FISH algorithm?

  A. The Lagged Fibonacci generator

  B. Prime number theory

  C. Equations that describe an ellipse

  D. The difficulty in factoring numbers

  Correct Answer: A

  The Lagged Fibonacci generator

  https://en.wikipedia.org/wiki/FISH_(cipher)

  The FISH (FIbonacci SHrinking) stream cipher is a fast software based stream cipher using Lagged Fibonacci generators, plus a concept from the shrinking generator cipher. It was published by Siemens in 1993. FISH is quite fast in software

  and has a huge key length. However, in the same paper where he proposed Pike, Ross Anderson showed that FISH can be broken with just a few thousand bits of known plaintext.

• Question 37:

  A cryptographic hash function which uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 cycles per byte for MD6-256 on an Intel Core 2 Duo and provable resistance against differential cryptanalysis.

  A. TIGER

  B. GOST

  C. MD5

  D. MD6

  Correct Answer: D

  MD6 https://en.wikipedia.org/wiki/MD6 The MD6 Message-Digest Algorithm is a cryptographic hash function. It uses a Merkle tree- like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 cycles per byte for MD6256 on an Intel Core 2 Duo and provable resistance against differential cryptanalysis.[2] The source code of the reference implementation was released under MIT license. Speeds in excess of 1 GB/s have been reported to be possible for long messages on 16- core CPU architecture. In December 2008, Douglas Held of Fortify Software discovered a buffer overflow in the original MD6 hash algorithm's reference implementation. This error was later made public by Ron Rivest on 19 February 2009, with a release of a corrected reference implementation in advance of the Fortify Report.

• Question 38:

  WPA2 uses AES for wireless data encryption at which of the following encryption levels?

  A. 128 bit and CRC

  B. 128 bi and TKIP

  C. 128 bit and CCMP

  D. 64 bit and CCMP

  Correct Answer: C

  128 bit and CCMP

  Counter Mode with Cipher Block Chaining Message Authentication Code Protocol (CCMP) is an encryption protocol that forms part of the 802.11i standard for wireless local area networks (WLANs), particularly those using WiMax technology.

  CCMP employs 128-bit keys and a 48-bit initialization vector that minimizes vulnerability to replay attacks.

• Question 39:

  Which of the following is the standard for digital certificates?

  A. RFC 2298

  B. X.509

  C. CRL

  D. CA

  Correct Answer: B

  https://en.wikipedia.org/wiki/X.509

  X.509 is a standard defining the format of public key certificates. X.509 certificates are used in many Internet protocols, including TLS/SSL, which is the basis for HTTPS, the secure protocol for browsing the web. They are also used in offline applications, like electronic signatures. An X.509 certificate contains a public key and an identity (a hostname, or an organization, or an individual), and is either signed by a certificate authority or self-signed. When a certificate is signed by a trusted certificate authority, or validated by other means, someone holding that certificate can rely on the public key it contains to establish secure communications with another party, or validate documents digitally signed by the corresponding private key.

• Question 40:

  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 Vigen鑢e cipher. It was first published by Friedrich Kasiski in 1863, but seems to have been independently discovered by Charles Babbage as early as 1846.