최신 212-81 무료덤프 - EC-COUNCIL Certified Encryption Specialist
In relationship to hashing, the term _____refers to random bits that are used as one of the inputs to the hash. Essentially the ______ is intermixed with the message that is to be hashed
정답: C
설명: (DumpTOP 회원만 볼 수 있음)
Changes to one character in the plain text affect multiple characters in the cipher text, unlike in historical algorithms where each plain text character only affect one cipher text character.
정답: A
설명: (DumpTOP 회원만 볼 수 있음)
Created in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT. Most widely used public key cryptography algorithm. Based on relationships with prime numbers. This algorithm is secure because it is difficult to factor a large integer composed of two or more large prime factors.
정답: D
설명: (DumpTOP 회원만 볼 수 있음)
In steganography, ________ is the data to be covertly communicated (in other words, it is the message you wish to hide).
정답: D
설명: (DumpTOP 회원만 볼 수 있음)
_____ uses at least two different shifts, changing the shift with different letters in the plain text.
정답: D
설명: (DumpTOP 회원만 볼 수 있음)
A symmetric block cipher designed in 1993 by Bruce Schneier. Was intended as a replacement for DES. Like DES it is a 16 round Feistel working on 64bit blocks. Can have bit sizes 32bits to 448bits.
정답: A
설명: (DumpTOP 회원만 볼 수 있음)
Cylinder tool. Wrap leather around to decode. The diameter is the key. Used in 7th century BC by greek poet Archilochus.
정답: D
설명: (DumpTOP 회원만 볼 수 있음)
Developed by Netscape and has been replaced by TLS. It was the preferred method used with secure websites.
정답: C
설명: (DumpTOP 회원만 볼 수 있음)
If you use substitution alone, what weakness is present in the resulting cipher text?
정답: A
설명: (DumpTOP 회원만 볼 수 있음)
During the process of encryption and decryption, what keys are shared?
정답: C
설명: (DumpTOP 회원만 볼 수 있음)
Bob's password is hashed, and so is John's. Even though they used different passwords, the hash is the same. What is this called?
정답: B
설명: (DumpTOP 회원만 볼 수 있음)
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.
정답: B
설명: (DumpTOP 회원만 볼 수 있음)