Notifications
The EC-COUNCIL wants to become the first choice for quick and complete EC-COUNCIL 212-81 exam preparation. To achieve this objective the EC-COUNCIL has hired a team of experienced and qualified 212-81 Exam trainers. They have years of experience in verifying Certified Encryption Specialist exam practice test questions.
The Itcertkey 212-81 Certified Encryption Specialist PDF dumps file work with all devices and operating system. You can easily install 212-81 Certified Encryption Specialist exam questions file on your desktop computer, laptop, tabs, and smartphone devices and start 212-81 Certified Encryption Specialist exam dumps preparation without wasting further time. Whereas the other two Itcertkey EC-COUNCIL 212-81 Practice Test software is concerned, both are the mock 212-81 Certified Encryption Specialist exam that will give you a real-time 212-81 practice exam environment for preparation.
The versions of our 212-81 study guide includes the PDF version, PC version, APP online version. Each version's using method and functions are different and the client can choose the most convenient version to learn our 212-81 exam materials. For example, the PDF version is convenient for you to download and print our 212-81 Test Questions and is suitable for browsing learning. If you use the PDF version you can print our 212-81 test torrent on the papers and it is convenient for you to take notes. You can learn our 212-81 test questions at any time and place.
NEW QUESTION # 52
Hash. Created by Ronald Rivest. Replaced MD4. 128 bit output size, 512 bit block size, 32 bit word size, 64 rounds. Infamously compromised by Flame malware in 2012.
Answer: D
Explanation:
MD5
https://en.wikipedia.org/wiki/MD5
The MD5 message-digest algorithm is a widely used hash function producing a 128-bit hash value. Although MD5 was initially designed to be used as a cryptographic hash function, it has been found to suffer from extensive vulnerabilities. It can still be used as a checksum to verify data integrity, but only against unintentional corruption. It remains suitable for other non-cryptographic purposes, for example for determining the partition for a particular key in a partitioned database.
MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, and was specified in 1992 as RFC 1321 Incorrect answers:
TIGER - hash. Created by Ross Anderson and Eli Baham. 192/160/128 bit output size, 512 bit block size, 53 bit word size, 24 rounds.
SHA-1 - Secure Hashing Algorithm. Designed by NSA. 160 bit output size, 512 bit block size, 40 bit word size, 80 rounds.
Keccak - SHA-3 (Secure Hash Algorithm 3) is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015. SHA-3 is a subset of the broader cryptographic primitive family Keccak, designed by Guido Bertoni, Joan Daemen, Michael Peeters, and Gilles Van Assche, building upon RadioGatun.
NEW QUESTION # 53
A simple algorithm that will take the initial key and from that generate a slightly different key each round.
Answer: A
Explanation:
Key Schedule
https://en.wikipedia.org/wiki/Key_schedule
In cryptography, the so-called product ciphers are a certain kind of cipher, where the (de-)ciphering of data is typically done as an iteration of rounds. The setup for each round is generally the same, except for round-specific fixed values called a round constant, and round-specific data derived from the cipher key called a round key. A key schedule is an algorithm that calculates all the round keys from the key.
Incorrect answers:
Feistel Network - (also known as Luby-Rackoff block cipher) is a symmetric structure used in the construction of block ciphers, named after the German-born physicist and cryptographer Horst Feistel who did pioneering research while working for IBM (USA).
SHA-2 - (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001. They are built using the Merkle-Damgard structure, from a one-way compression function itself built using the Davies-Meyer structure from a specialized block cipher.
Diffie-Hellman - key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.
NEW QUESTION # 54
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
Answer: A
Explanation:
Salt
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 salt is one of those methods.
Incorrect answers:
Vector - Wrong!
IV - an initialization vector or starting variable (SV) is a fixed-size input to a cryptographic primitive that is typically required to be random or pseudorandom. Randomization is crucial for encryption schemes to achieve semantic security, a property whereby repeated usage of the scheme under the same key does not allow an attacker to infer relationships between segments of the encrypted message. For block ciphers, the use of an IV is described by the modes of operation. Randomization is also required for other primitives, such as universal hash functions and message authentication codes based thereon.
Stream - A stream cipher is a symmetric key cipher where plaintext digits are combined with a pseudorandom cipher digit stream (keystream). In a stream cipher, each plaintext digit is encrypted one at a time with the corresponding digit of the keystream, to give a digit of the ciphertext stream. Since encryption of each digit is dependent on the current state of the cipher, it is also known as state cipher. In practice, a digit is typically a bit and the combining operation is an exclusive-or (XOR).
NEW QUESTION # 55
Which of the following acts as a verifier for the certificate authority?
Answer: C
Explanation:
Registration authority
https://en.wikipedia.org/wiki/Registration_authority
Registration authorities exist for many standards organizations, such as ANNA (Association of National Numbering Agencies for ISIN), the Object Management Group, W3C, IEEE and others. In general, registration authorities all perform a similar function, in promoting the use of a particular standard through facilitating its use. This may be by applying the standard, where appropriate, or by verifying that a particular application satisfies the standard's tenants. Maintenance agencies, in contrast, may change an element in a standard based on set rules - such as the creation or change of a currency code when a currency is created or revalued (i.e. TRL to TRY for Turkish lira). The Object Management Group has an additional concept of certified provider, which is deemed an entity permitted to perform some functions on behalf of the registration authority, under specific processes and procedures documented within the standard for such a role.
NEW QUESTION # 56
Which of the following equations is related to EC?
