최신EC-COUNCIL Certified Encryption Specialist - 212-81무료샘플문제
문제1
If the round function is a cryptographically secure pseudorandom function, then ___________ rounds is sufficient to make the block cipher a pseudorandom permutation.
If the round function is a cryptographically secure pseudorandom function, then ___________ rounds is sufficient to make the block cipher a pseudorandom permutation.
정답: D
설명: (ITDumpsKR 회원만 볼 수 있음)
문제2
Modern symmetric ciphers all make use of one or more s-boxes. Both Feistel and non-Feistel ciphers use these s-boxes. What is an s-box?
Modern symmetric ciphers all make use of one or more s-boxes. Both Feistel and non-Feistel ciphers use these s-boxes. What is an s-box?
정답: C
설명: (ITDumpsKR 회원만 볼 수 있음)
문제3
As a network administrator, you have implemented WPA2 encryption in your corporate wireless network. The WPA2's ________ integrity check mechanism provides security against a replay attack.
As a network administrator, you have implemented WPA2 encryption in your corporate wireless network. The WPA2's ________ integrity check mechanism provides security against a replay attack.
정답: B
설명: (ITDumpsKR 회원만 볼 수 있음)
문제4
How does Kerberos generate the first secret key in the authentication process?
How does Kerberos generate the first secret key in the authentication process?
정답: B
문제5
Ciphers that write message letters out diagonally over a number of rows then read off cipher row by row. Also called zig-zag cipher.
Ciphers that write message letters out diagonally over a number of rows then read off cipher row by row. Also called zig-zag cipher.
정답: D
설명: (ITDumpsKR 회원만 볼 수 있음)
문제6
If the round function is a cryptographically secure pseudorandom function, then ___rounds is sufficient to make it a "strong" pseudorandom permutation.
If the round function is a cryptographically secure pseudorandom function, then ___rounds is sufficient to make it a "strong" pseudorandom permutation.
정답: D
설명: (ITDumpsKR 회원만 볼 수 있음)
문제7
A cryptographic hash function which uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 cycles per byte for MD6-256 on an Intel Core 2 Duo and provable resistance against differential cryptanalysis.
A cryptographic hash function which uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 cycles per byte for MD6-256 on an Intel Core 2 Duo and provable resistance against differential cryptanalysis.
정답: C
설명: (ITDumpsKR 회원만 볼 수 있음)
문제8
Early attempt to make substitution ciphers more robust, masks letter frequencies, plain text letters map to multiple cipher text symbols.
Early attempt to make substitution ciphers more robust, masks letter frequencies, plain text letters map to multiple cipher text symbols.
정답: A
설명: (ITDumpsKR 회원만 볼 수 있음)
문제9
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?
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?
정답: B
설명: (ITDumpsKR 회원만 볼 수 있음)
문제10
A transposition cipher invented 1918 by Fritz Nebel, used a 36 letter alphabet and a modified Polybius square with a single columnar transposition.
A transposition cipher invented 1918 by Fritz Nebel, used a 36 letter alphabet and a modified Polybius square with a single columnar transposition.
정답: B
설명: (ITDumpsKR 회원만 볼 수 있음)
문제11
With Electronic codebook (ECB) what happens:
With Electronic codebook (ECB) what happens:
정답: B
설명: (ITDumpsKR 회원만 볼 수 있음)