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 200 - 212-81 discussion

Widely used, particularly with Microsoft operating systems. Created by MIT and derives its name from the mythical three headed dog. The is a great deal of verification for the tickets and the tickets expire quickly. Client authenticates to the Authentication Server once using a long term shared secret and receives back a Ticket-Granting Server. Client can reuse this ticket to get additional tickets without reusing the shared secret. These tickets are used to prove authentication to the Service Server.

Diffie-Hellman

Yarrow

Kerberos

ElGamal

Suggested answer: C

Explanation:

Kerberos

https://en.wikipedia.org/wiki/Kerberos_(protocol)

Kerberos is a computer-network authentication protocol that works on the basis of tickets to allow nodes communicating over a non-secure network to prove their identity to one another in a secure manner. The protocol was named after the character Kerberos (or Cerberus) from Greek mythology, the ferocious three-headed guard dog of Hades. Its designers aimed it primarily at a client--server model and it provides mutual authentication---both the user and the server verify each other's identity. Kerberos protocol messages are protected against eavesdropping and replay attacks.

Kerberos builds on symmetric key cryptography and requires a trusted third party, and optionally may use public-key cryptography during certain phases of authentication. Kerberos uses UDP port 88 by default.

Incorrect answers:

ElGamal - ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie--Hellman key exchange. It was described by Taher Elgamal in 1985. ElGamal encryption is used in the free GNU Privacy Guard software, recent versions of PGP, and other cryptosystems. The Digital Signature Algorithm (DSA) is a variant of the ElGamal signature scheme, which should not be confused with ElGamal encryption.

Diffie-Hellman - 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 conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.[1][2] DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key.

Yarrow - algorithm is a family of cryptographic pseudorandom number generators (CPRNG) devised by John Kelsey, Bruce Schneier, and Niels Ferguson and published in 1999. The Yarrow algorithm is explicitly unpatented, royalty-free, and open source; no license is required to use it. Yarrow is incorporated in iOS and macOS for their /dev/random devices, and was in FreeBSD (where it is superseded by Fortuna).

Show Answer

asked 18/09/2024

Kanta Prasad

38 questions

Your answer: A B C D

0 comments

Sorted by