QUESTION: 97

A protocol for key aggreement based on Diffie-Hellman. Created in 1995. Incorporated into the public key standard IEEE P1363.

Blum Blum Shub
Elliptic Curve
Menezes-Qu-Vanstone
Euler's totient

Answer(s): C

Explanation:

Menezes-Qu-Vanstone https://en.wikipedia.org/wiki/MQV
MQV (Menezes–Qu–Vanstone) is an authenticated protocol for key agreement based on the Diffie– Hellman scheme. Like other authenticated Diffie–Hellman schemes, MQV provides protection against an active attacker. The protocol can be modified to work in an arbitrary finite group, and, in particular, elliptic curve groups, where it is known as elliptic curve MQV (ECMQV).
MQV was initially proposed by Alfred Menezes, Minghua Qu and Scott Vanstone in 1995. It was modified with Law and Solinas in 1998.

Incorrect answers:
Elliptic Curve - an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security.
Euler's totient - function counts the positive integers up to a given integer n that are relatively prime to n.
Blum Blum Shub - a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub that is derived from Michael O. Rabin's one-way function.

Reveal Solution Next Question

QUESTION: 98

What is the largest key size that AES can use?

Answer(s): A

Explanation:

256
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits.

Reveal Solution Next Question

QUESTION: 99

Terrance oversees the key escrow server for his company. All employees use asymmetric cryptography to encrypt all emails. How many keys are needed for asymmetric cryptography?

Answer(s): A

Explanation:

2
https://en.wikipedia.org/wiki/Public-key_cryptography
Public-key cryptography, or asymmetric cryptography, is a cryptographic system that uses pairs of keys: public keys, which may be disseminated widely, and private keys, which are known only to the owner. The generation of such keys depends on cryptographic algorithms based on mathematical problems to produce one-way functions. Effective security only requires keeping the private key private; the public key can be openly distributed without compromising security.
In such a system, any person can encrypt a message using the receiver's public key, but that encrypted message can only be decrypted with the receiver's private key.

Reveal Solution Next Question

QUESTION: 100

Which of the following is required for a hash?

Not vulnerable to a brute force attack
Few collisions
Must use SALT
Not reversible
Variable length input, fixed length output
Minimum key length

Answer(s): D,E

Explanation:

Correct answers: Variable length input, fixed length output and Not reversible https://en.wikipedia.org/wiki/Hash_function
A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing.

Reveal Solution Next Question

Free 212-81 Exam Braindumps (page: 25)

QUESTION: 97

Explanation:

QUESTION: 98

Explanation:

QUESTION: 99

Explanation:

QUESTION: 100

Explanation: