Home / ECCouncil / 212-81

Question list

List of questions

Question 1

(0)

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.

Question 2

(0)

Which of the following statements is most true regarding binary operations and encryption?

Question 3

(0)

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.

Question 4

(0)

What is an IV?

Question 5

(0)

Part of understanding cryptography is understanding the cryptographic primitives that go into any crypto system. A(n) _______ is a fixed-size input to a cryptographic primitive that is random or pse

Question 6

(0)

The most common way steganography is accomplished is via which one of the following?

Question 7

(0)

A _______ product refers to an NSA-endorsed classified or controlled cryptographic item for classified or sensitive U. S. government information, including cryptographic equipment, assembly, or comp

Question 8

(0)

The reverse process from encoding - converting the encoded message back into its plaintext format.

Question 9

(0)

Which of the following asymmetric algorithms is described by U.S. Patent 5,231,668 and FIPS 186

Question 10

(0)

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?

Question 115 - 212-81 discussion

Suggested answer: A, C

Explanation:

K3 and K4

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

The German Federal Office for Information Security (Bundesamt fr Sicherheit in der Informationstechnik, BSI) has established four criteria for quality of deterministic random number generators.They are summarized here:

K1 -- There should be a high probability that generated sequences of random numbers are different from each other.

K2 -- A sequence of numbers is indistinguishable from 'truly random' numbers according to specified statistical tests. The tests are the monobit test (equal numbers of ones and zeros in the sequence), poker test (a special instance of the chi-squared test), runs test (counts the frequency of runs of various lengths), longruns test (checks whether there exists any run of length 34 or greater in 20 000 bits of the sequence)---both from BSI and NIST, and the autocorrelation test. In essence, these requirements are a test of how well a bit sequence: has zeros and ones equally often; after a sequence of n zeros (or ones), the next bit a one (or zero) with probability one-half; and any selected subsequence contains no information about the next element(s) in the sequence.

K3 -- It should be impossible for an attacker (for all practical purposes) to calculate, or otherwise guess, from any given subsequence, any previous or future values in the sequence, nor any inner state of the generator.

K4 -- It should be impossible, for all practical purposes, for an attacker to calculate, or guess from an inner state of the generator, any previous numbers in the sequence or any previous inner generator states.

For cryptographic applications, only generators meeting the K3 or K4 standards are acceptable.

Show Answer

asked 18/09/2024

james campbell

38 questions

Your answer: A B C D E

0 comments

Sorted by