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

List of questions
Question 131

What is the basis for the FISH algorithm?
Question 132

If the round function is a cryptographically secure pseudorandom function, then ___rounds is sufficient to make it a 'strong' pseudorandom permutation.
Question 133

Which one of the following best describes a process that splits the block of plaintext into two separate blocks, then applies the round function to one half, and finally swaps the two halves?
Question 134

John is trying to explain the basics of cryptography to a group of young, novice, security students. Which one of the following most accurately defines encryption?
Question 135

Numbers that have no factors in common with another.
Question 136

RFC 1321 describes what hash?
Question 137

Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 Xi m.
Question 138

Which algorithm implements an unbalanced Feistel cipher?
Question 139

What is a variation of DES that uses a technique called Key Whitening?
Question 140

You are explaining the details of the AES algorithm to cryptography students. You are discussing the derivation of the round keys from the shared symmetric key. The portion of AES where round keys are derived from the cipher key using Rijndael's key schedule is called what?
Question