ExamGecko
Home Home / ECCouncil / 212-81

ECCouncil 212-81 Practice Test - Questions Answers, Page 18

Question list
Search
Search

List of questions

Search

Related questions











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
A.
Rot13
Answers
B.
Caesar
B.
Caesar
Answers
C.
Atbash
C.
Atbash
Answers
D.
Vigenre
D.
Vigenre
Answers
Suggested answer: D

Explanation:

Vigenre

https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher

The Vigenre 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 indchiffrable (French for 'the indecipherable cipher'). Many people have tried to implement encryption schemes that are essentially Vigenre ciphers. In 1863, Friedrich Kasiski was the first to publish a general method of deciphering Vigenre ciphers.

Ahlen is using a set of pre-calculated hashes to attempt to derive the passwords from a Windows SAM file. What is a set of pre-calculated hashes used to derive a hashed password called?

A.
Hash matrix
A.
Hash matrix
Answers
B.
Rainbow table
B.
Rainbow table
Answers
C.
Password table
C.
Password table
Answers
D.
Hash table
D.
Hash table
Answers
Suggested answer: B

Explanation:

Rainbow table

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

A rainbow table is a precomputed table for caching the output of cryptographic hash functions, usually for cracking password hashes. Tables are usually used in recovering a key derivation function (or credit card numbers, etc.) up to a certain length consisting of a limited set of characters. It is a practical example of a space--time tradeoff, using less computer processing time and more storage than a brute-force attack which calculates a hash on every attempt, but more processing time and less storage than a simple key derivation function with one entry per hash. Use of a key derivation that employs a salt makes this attack infeasible.

Asymmetric encryption method developed in 1984. It is used in PGP implementations and GNU Privacy Guard Software. Consists of 3 parts: key generator, encryption algorithm, and decryption algorithm.

A.
Tiger
A.
Tiger
Answers
B.
GOST
B.
GOST
Answers
C.
RIPEMD
C.
RIPEMD
Answers
D.
ElGamal
D.
ElGamal
Answers
Suggested answer: D

Explanation:

ElGamal

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

the 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.

Incorrect answers:

Tiger -is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of a Tiger hash value is 192 bits. Truncated versions (known as Tiger/128 and Tiger/160) can be used for compatibility with protocols assuming a particular hash size. Unlike the SHA-2 family, no distinguishing initialization values are defined; they are simply prefixes of the full Tiger/192 hash value.

GOST -hash function, defined in the standards GOST R 34.11-94 and GOST 34.311-95 is a 256-bit cryptographic hash function. It was initially defined in the Russian national standard GOST R 34.11-94 Information Technology -- Cryptographic Information Security -- Hash Function. The equivalent standard used by other member-states of the CIS is GOST 34.311-95.

RIPEMD -is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). There are five functions in the family: RIPEMD, RIPEMD-128, RIPEMD-160, RIPEMD-256, and RIPEMD-320, of which RIPEMD-160 is the most common.

In which of the following password protection technique, random strings of characters are added to the password before calculating their hashes?

A.
Keyed Hashing
A.
Keyed Hashing
Answers
B.
Double Hashing
B.
Double Hashing
Answers
C.
Salting
C.
Salting
Answers
D.
Key Stretching
D.
Key Stretching
Answers
Suggested answer: C

Explanation:

Salting

https://en.wikipedia.org/wiki/Salt_(cryptography)

A salt is random data that is used as an additional input to a one-way function that hashes data, a password or passphrase. Salts are used to safeguard passwords in storage. Historically a password was stored in plaintext on a system, but over time additional safeguards were developed to protect a user's password against being read from the system.

A new salt is randomly generated for each password. In a typical setting, the salt and the password (or its version after key stretching) are concatenated and processed with a cryptographic hash function, and the output hash value (but not the original password) is stored with the salt in a database. Hashing allows for later authentication without keeping and therefore risking exposure of the plaintext password in the event that the authentication data store is compromised.

Salts defend against a pre-computed hash attack, e.g. rainbow tables.Since salts do not have to be memorized by humans they can make the size of the hash table required for a successful attack prohibitively large without placing a burden on the users. Since salts are different in each case, they also protect commonly used passwords, or those users who use the same password on several sites, by making all salted hash instances for the same password different from each other.

You are explaining basic mathematics to beginning cryptography students. You are covering the basic math used in RS

A.
A prime number is defined as
A.
A prime number is defined as
Answers
B.
Odd numbers with no divisors
B.
Odd numbers with no divisors
Answers
C.
Odd numbers
C.
Odd numbers
Answers
D.
Any number only divisible by odd numbers
D.
Any number only divisible by odd numbers
Answers
E.
Any number only divisible by one and itself
E.
Any number only divisible by one and itself
Answers
Suggested answer: C

Explanation:

Any number only divisible by one and itself

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

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 5 or 5 1, involve 5 itself. However, 4 is composite because it is a product (2 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

During the process of encryption and decryption, what keys are shared?

A.
Public keys
A.
Public keys
Answers
B.
Public and private keys
B.
Public and private keys
Answers
C.
User passwords
C.
User passwords
Answers
D.
Private keys
D.
Private keys
Answers
Suggested answer: A

Explanation:

Public keys

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.

Alice and Bob have two keys of their own --- just to be clear, that's four keys total. Each party has their own public key, which they share with the world, and their own private key which they well, which they keep private, of course but, more than that, which they keep as a closely guarded secret. The magic of public key cryptography is that a message encrypted with the public key can only be decrypted with the private key. Alice will encrypt her message with Bob's public key, and even though Eve knows she used Bob's public key, and even though Eve knows Bob's public key herself, she is unable to decrypt the message. Only Bob, using his secret key, can decrypt the message assuming he's kept it secret, of course.

Alice and Bob do not need to plan anything ahead of time to communicate securely: they generate their public-private key pairs independently, and happily broadcast their public keys to the world at large. Alice can rest assured that only Bob can decrypt the message she sends because she has encrypted it with his public key.

How many qubits are needed to break RSA?

A.
1000
A.
1000
Answers
B.
2000
B.
2000
Answers
C.
4000
C.
4000
Answers
D.
100
D.
100
Answers
Suggested answer: C

How does Kerberos generate the first secret key in the authentication process?

A.
By generating a random AES key
A.
By generating a random AES key
Answers
B.
By creating a hash of the user password
B.
By creating a hash of the user password
Answers
C.
By hashing the user ID, network ID. and salt
C.
By hashing the user ID, network ID. and salt
Answers
D.
By using the user's public key
D.
By using the user's public key
Answers
Suggested answer: B

John is trying to select the appropriate authentication protocol for his company. Which of the following types of authentication solutions use tickets to provide access to various resources from a central location?

A.
Kerberos
A.
Kerberos
Answers
B.
EAP
B.
EAP
Answers
C.
Radius
C.
Radius
Answers
D.
CHAP
D.
CHAP
Answers
Suggested answer: A

A part of understanding symmetric cryptography understands the modes in which it can be used. You are

explaining those modes to a group of cryptography students. The most basic encryption mode is____________.

The message is divided into blocks, and each block is encrypted separately with no modification to the process.

A.
Cipher block chaining (CBC)
A.
Cipher block chaining (CBC)
Answers
B.
Cipher feedback (CFB)
B.
Cipher feedback (CFB)
Answers
C.
Output feedback (OFB)
C.
Output feedback (OFB)
Answers
D.
Electronic codebook (ECB)
D.
Electronic codebook (ECB)
Answers
Suggested answer: D
Total 206 questions
Go to page: of 21