2024 Reliable Study Materials & Testing Engine for 212-81 Exam Success!
Validate your Skills with Updated 212-81 Exam Questions & Answers and Test Engine
The Certified Encryption Specialist certification is ideal for professionals who work in the field of cyber security, network security, and information technology. It is particularly valuable for professionals who are responsible for designing, implementing, and managing secure systems that protect sensitive data. Certified Encryption Specialist certification can also help professionals advance their careers by demonstrating their expertise in encryption technologies.
The EC-Council Certified Encryption Specialist (ECES) certification exam is a highly valued certification in the cybersecurity industry. It tests an individual's knowledge and skills in encryption techniques and their ability to implement encryption technologies in real-world scenarios. ECES certified professionals are in high demand and can expect to earn a premium salary in the IT industry. Candidates can prepare for the certification exam by enrolling in EC-Council's official training program or studying independently using EC-Council's study materials.
NEW QUESTION # 32
Message hidden in unrelated text. Sender and receiver have pre-arranged to use a pattern to remove certain letters from the message which leaves only the true message behind.
- A. Vigenere Cipher
- B. Caesar Cipher
- C. Null Ciphers
- D. Playfair Cipher
Answer: C
Explanation:
Null Ciphers
https://en.wikipedia.org/wiki/Null_cipher
A null cipher, also known as concealment cipher, is an ancient form of encryption where the plaintext is mixed with a large amount of non-cipher material. Today it is regarded as a simple form of steganography, which can be used to hide ciphertext.
Incorrect answers:
Caesar Cipher - Monoalphabetic cipher where letters are shifted one or more letters in either direction. The method is named after Julius Caesar, who used it in his private correspondence.
Vigenère - 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.
Playfair Cipher - manual symmetric encryption technique and was the first literal digram substitution cipher. The scheme was invented in 1854 by Charles Wheatstone, but bears the name of Lord Playfair for promoting its use.
NEW QUESTION # 33
What does the OCSP protocol provide?
- A. Encryption
- B. Revoked certificates
- C. Hashing
- D. VPN connectivity
Answer: B
Explanation:
Revoked certificates
https://en.wikipedia.org/wiki/Online_Certificate_Status_Protocol
The Online Certificate Status Protocol (OCSP) is an Internet protocol used for obtaining the revocation status of an X.509 digital certificate.It is described in RFC 6960 and is on the Internet standards track. It was created as an alternative to certificate revocation lists (CRL), specifically addressing certain problems associated with using CRLs in a public key infrastructure (PKI). Messages communicated via OCSP are encoded in ASN.1 and are usually communicated over HTTP. The "request/response" nature of these messages leads to OCSP servers being termed OCSP responders.
NEW QUESTION # 34
Which algorithm was U. S. Patent 5,231,668, filed on july 26, 1991, attributed to David W. Kravitz, and adopted by the U. S. government in 1993 with FIPS 186?
- A. DSA
- B. RSA
- C. AES
- D. RC4
Answer: A
Explanation:
DSA
https://en.wikipedia.org/wiki/Digital_Signature_Algorithm
DSA is covered by U.S. Patent 5,231,668 , filed July 26, 1991 and now expired, and attributed to David
W. Kravitz, a former NSA employee. This patent was given to "The United States of America as represented by the Secretary of Commerce, Washington, D.C.", and NIST has made this patent available worldwide royalty-free. Claus
P. Schnorr claims that his U.S. Patent 4,995,082 (also now expired) covered DSA; this claim is disputed.
NEW QUESTION # 35
A digital document that contains a public key and some information to allow your system to verify where that key came from. Used for web servers, Cisco Secure phones, E-Commerce.
- A. Payload
- B. OCSP
- C. Digital Certificate
- D. Registration Authority
Answer: C
Explanation:
Digital Certificate
https://en.wikipedia.org/wiki/Public_key_certificate
A public key certificate, also known as a digital certificate or identity certificate, is an electronic document used to prove the ownership of a public key. The certificate includes information about the key, information about the identity of its owner (called the subject), and the digital signature of an entity that has verified the certificate's contents (called the issuer).
Incorrect answers:
OCSP - Provides certificate validation in real time and will let you know if it is valid or has been revoked.
Registration Authority (RA) - сomponent of PKI that validates the identity of an entity requesting a digital certificate.
Payload - In computing and telecommunications, the payload is the part of transmitted data that is the actual intended message. Headers and metadata are sent only to enable payload delivery. In the steganography - information to be concealed and sent secretly, or the data covertly communicated;
NEW QUESTION # 36
Juanita has been assigned the task of selecting email encryption for the staff of the insurance company she works for. The various employees often use diverse email clients. Which of the following methods is available as an add-in for most email clients?
- A. Caesar cipher
- B. RSA
- C. PGP
- D. DES
Answer: C
Explanation:
PGP
https://en.wikipedia.org/wiki/Pretty_Good_Privacy
Pretty Good Privacy (PGP) is an encryption program that provides cryptographic privacy and authentication for data communication. PGP is used for signing, encrypting, and decrypting texts, e-mails, files, directories, and whole disk partitions and to increase the security of e-mail communications. Phil Zimmermann developed PGP in 1991.
NEW QUESTION # 37
Which service in a PKI will vouch for the identity of an individual or company?
- A. KDC
- B. CA
- C. CBC
- D. CR
Answer: B
Explanation:
CA
https://en.wikipedia.org/wiki/Certificate_authority
A certificate authority or certification authority (CA) is an entity that issues digital certificates. A digital certificate certifies the ownership of a public key by the named subject of the certificate. This allows others (relying parties) to rely upon signatures or on assertions made about the private key that corresponds to the certified public key. A CA acts as a trusted third party-trusted both by the subject (owner) of the certificate and by the party relying upon the certificate. The format of these certificates is specified by the X.509 or EMV standard.
NEW QUESTION # 38
If the round function is a cryptographically secure pseudorandom function, then ___________ rounds is sufficient to make the block cipher a pseudorandom permutation.
- A. 0
- B. 1
- C. 2
- D. 3
Answer: D
Explanation:
3
https://en.wikipedia.org/wiki/Feistel_cipher
Michael Luby and Charles Rackoff analyzed the Feistel cipher construction, and proved that if the round function is a cryptographically secure pseudorandom function, with Ki used as the seed, then 3 rounds are sufficient to make the block cipher a pseudorandom permutation, while 4 rounds are sufficient to make it a "strong" pseudorandom permutation (which means that it remains pseudorandom even to an adversary who gets oracle access to its inverse permutation). Because of this very important result of Luby and Rackoff, Feistel ciphers are sometimes called Luby-Rackoff block ciphers.
NEW QUESTION # 39
What size block does AES work on?
- A. 0
- B. 1
- C. 2
- D. 3
Answer: B
Explanation:
128
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
Rijndael is a family of ciphers with different key and block sizes. For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits.
NEW QUESTION # 40
A symmetric Stream Cipher published by the German engineering firm Seimans in 1993. A software based stream cipher that uses a Lagged Fibonacci generator along with concepts borrowed from shrinking generator ciphers.
- A. FISH
- B. IDEA
- C. DESX
- D. Twofish
Answer: A
Explanation:
FISH
https://en.wikipedia.org/wiki/FISH_(cipher)
The FISH (FIbonacci SHrinking) stream cipher is a fast software based stream cipher using Lagged Fibonacci generators, plus a concept from the shrinking generator cipher. It was published by Siemens in 1993. FISH is quite fast in software and has a huge key length. However, in the same paper where he proposed Pike, Ross Anderson showed that FISH can be broken with just a few thousand bits of known plaintext.
Incorrect answers:
Twofish - symmetric algorithm. Designed by Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, and Niels Ferguson. Uses a block size of 128 bits and key sizes of 128, 192, or 256 bits. It is a Feistel cipher.
IDEA - symmetric algorithm. Designed by James Massey and Xuejia Lai. Operates on 64 bit blocks and has a 128 bit key. Consists of 8 identical transformations each round and an output transformation.
DESX - symmetric algorithm. 64 bit key is appended to data, XOR it, and then apply the DES algorithm.
NEW QUESTION # 41
The mode makes a block cipher into a synchronous stream cipher. It generates keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext.
- A. Cipher feedback (CFB)
- B. Electronic codebook (ECB)
- C. Output feedback (OFB)
- D. Cipher-block chaining (CBC)
Answer: C
Explanation:
Output feedback (OFB)
https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation#Output_feedback_(OFB) The output feedback (OFB) mode makes a block cipher into a synchronous stream cipher. It generates keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext. Just as with other stream ciphers, flipping a bit in the ciphertext produces a flipped bit in the plaintext at the same location. This property allows many error-correcting codes to function normally even when applied before encryption.
Incorrect answers:
Cipher feedback (CFB) - mode, a close relative of CBC, makes a block cipher into a self-synchronizing stream cipher.
Electronic codebook (ECB) - the simplest of the encryption modes (named after conventional physical codebooks). The message is divided into blocks, and each block is encrypted separately.
Cipher-block chaining (CBC) - Ehrsam, Meyer, Smith and Tuchman invented the cipher block chaining (CBC) mode of operation in 1976. In CBC mode, each block of plaintext is XORed with the previous ciphertext block before being encrypted. This way, each ciphertext block depends on all plaintext blocks processed up to that point. To make each message unique, an initialization vector must be used in the first block.
NEW QUESTION # 42
What size block does FORK256 use?
- A. 0
- B. 1
- C. 2
- D. 3
Answer: C
Explanation:
512
https://en.wikipedia.org/wiki/FORK-256
FORK-256 was introduced at the 2005 NIST Hash workshop and published the following year.[6] FORK-256 uses 512-bit blocks and implements preset constants that change after each repetition. Each block is hashed into a 256-bit block through four branches that divides each 512 block into sixteen 32-bit words that are further encrypted and rearranged
NEW QUESTION # 43
What is the basis for the FISH algorithm?
- A. The Lagged Fibonacci generator
- B. Equations that describe an ellipse
- C. The difficulty in factoring numbers
- D. Prime number theory
Answer: A
Explanation:
The Lagged Fibonacci generator
https://en.wikipedia.org/wiki/FISH_(cipher)
The FISH (FIbonacci SHrinking) stream cipher is a fast software based stream cipher using Lagged Fibonacci generators, plus a concept from the shrinking generator cipher. It was published by Siemens in 1993. FISH is quite fast in software and has a huge key length. However, in the same paper where he proposed Pike, Ross Anderson showed that FISH can be broken with just a few thousand bits of known plaintext.
NEW QUESTION # 44
This is a 128 bit hash that is specified by RFC 1321. It was designed by Ron Rivest in 1991 to replace an earlier hash function.
- A. RSA
- B. SHA1
- C. MD5
- D. SHA-256
Answer: C
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:
SHA1 - (Secure Hash Algorithm 1) is a cryptographic hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest - typically rendered as a hexadecimal number, 40 digits long. It was designed by the United States National Security Agency, and is a U.S. Federal Information Processing Standard.
RSA - (Rivest-Shamir-Adleman) is a public-key cryptosystem that is widely used for secure data transmission. It is also one of the oldest. The acronym RSA comes from the surnames of Ron Rivest, Adi Shamir, and Leonard Adleman, who publicly described the algorithm in 1977. An equivalent system was developed secretly, in 1973 at GCHQ (the British signals intelligence agency), by the English mathematician Clifford Cocks. That system was declassified in 1997.
SHA-256 - 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. SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of six hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256
NEW QUESTION # 45
Which one of the following wireless standards uses the Advanced Encryption Standard (AES) using the Counter Mode-Cipher Block Chaining (CBC)-Message Authentication Code (MAC) Protocol (CCMP)?
- A. WEP
- B. WPA2
- C. WPA
- D. WEP2
Answer: B
Explanation:
WPA2
https://en.wikipedia.org/wiki/Wi-Fi_Protected_Access#WPA2
WPA2 use the Counter Mode-Cipher Block Chaining (CBC)-Message Authentication Code (MAC) Protocol (CCMP).
NEW QUESTION # 46
Which one of the following is an authentication method that sends the username and password in cleartext?
- A. CHAP
- B. PAP
- C. SPAP
- D. Kerberos
Answer: B
Explanation:
PAP
https://en.wikipedia.org/wiki/Password_Authentication_Protocol
Password Authentication Protocol (PAP) is a password-based authentication protocol used by Point to Point Protocol (PPP) to validate users. Almost all network operating system remote servers support PAP. PAP is specified in RFC 1334.
PAP is considered a weak authentication scheme (weak schemes are simple and have lighter computational overhead but are much more vulnerable to attack; while weak schemes may have limited application in some constrained environments, they are avoided in general). Among PAP's deficiencies is the fact that it transmits unencrypted passwords (i.e. in plain-text) over the network. PAP is therefore used only as a last resort when the remote server does not support a stronger scheme such as CHAP or EAP.
Incorrect answers:
SPAP - Shiva Password Authentication Protocol, PAP with encryption for the usernames/passwords that are transmitted.
CHAP - calculates a hash, shares the hash with the client system, the hash is periodically validated to ensure nothing has changed.
Kerberos - computer-network authentication protocol that works on the basis of tickets to allow nodes communicating over a non-secure network to prove their identity to one another in a secure manner. Its designers aimed it primarily at a client-server model and it provides mutual authentication-both the user and the server verify each other's identity. Kerberos protocol messages are protected against eavesdropping and replay attacks.
Kerberos builds on symmetric key cryptography and requires a trusted third party, and optionally may use public-key cryptography during certain phases of authentication.
NEW QUESTION # 47
Used to take the burden off of a CA by handling verification prior to certificates being issued. Acts as a proxy between user and CA.
Receives request, authenticates it and forwards it to the CA.
- A. PKI (Public Key Infrastructure)
- B. TTP (Trusted Third Party)
- C. RA (Registration Authority)
- D. CP (Certificate Policy)
Answer: C
Explanation:
RA (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.
Incorrect answers:
TTP (Trusted Third Party) - is an entity which facilitates interactions between two parties who both trust the third party; the Third Party reviews all critical transaction communications between the parties, based on the ease of creating fraudulent digital content. In TTP models, the relying parties use this trust to secure their own interactions. TTPs are common in any number of commercial transactions and in cryptographic digital transactions as well as cryptographic protocols, for example, a certificate authority (CA) would issue a digital identity certificate to one of the two parties in the next example. The CA then becomes the Trusted-Third-Party to that certificates issuance. Likewise transactions that need a third party recordation would also need a third-party repository service of some kind or another.
CP (Certificate Policy) - is a document which aims to state what are the different entities of a public key infrastructure (PKI), their roles and their duties. This document is published in the PKI perimeter.
When in use with X.509 certificates, a specific field can be set to include a link to the associated certificate policy. Thus, during an exchange, any relying party has an access to the assurance level associated with the certificate, and can decide on the level of trust to put in the certificate.
PKI (Public Key Infrastructure) - is a set of roles, policies, hardware, software and procedures needed to create, manage, distribute, use, store and revoke digital certificates and manage public-key encryption. The purpose of a PKI is to facilitate the secure electronic transfer of information for a range of network activities such as e-commerce, internet banking and confidential email. It is required for activities where simple passwords are an inadequate authentication method and more rigorous proof is required to confirm the identity of the parties involved in the communication and to validate the information being transferred.
NEW QUESTION # 48
Why is quantum computing a threat to RSA?
- A. The processing speed will brute force algorithms
- B. Quantum computers can factor large integers in polynomial time
- C. Quantum computers can solve the discrete logarithm problem
- D. Quantum computers can solve the birthday paradox
Answer: B
NEW QUESTION # 49
What advantage do symmetric algorithms have over asymmetric algorithms
- A. They are faster
- B. It is easier to implement them in software
- C. They are more secure
Answer: A
Explanation:
D It is easier to exchange keys
Explanation:
They are faster
Symmetric key encryption is much faster than asymmetric key encryption, because both the sender and the recipient of a message to use the same secret key.
NEW QUESTION # 50
A type of frequency analysis used to attack polyalphabetic substitution ciphers. It's used to try to discover patterns and use that information to decrypt the cipher.
- A. Kasiski Method
- B. Birthday Attack
- C. Integral Cryptanalysis
- D. Information Deduction
Answer: A
Explanation:
Kasiski Method
https://en.wikipedia.org/wiki/Kasiski_examination
In cryptanalysis, Kasiski examination (also referred to as Kasiski's test or Kasiski's method) is a method of attacking polyalphabetic substitution ciphers, such as the Vigenère cipher. It was first published by Friedrich Kasiski in 1863, but seems to have been independently discovered by Charles Babbage as early as 1846.
Incorrect answers:
Integral Cryptanalysis - uses lots of sets of plaintext that are similar with slight modifications. These are encrypted and then the variations are analyzed to determine if there's anything that can be zeroed in on.
Information Deduction - the attacker gains some Shannon information about plaintexts (or ciphertexts) not previously known.
Birthday Attack - cryptographic attack that exploits the mathematics behind the birthday problem in the probability theory forces collisions within hashing functions.
NEW QUESTION # 51
Ferris has been assigned the task of selecting security for his company's wireless network. It is important that he pick the strongest form of wireless security. Which one of the following is the strongest wireless security?
- A. TKIP
- B. WEP
- C. WPA2
- D. WPA
Answer: C
Explanation:
WPA2
https://en.wikipedia.org/wiki/Wi-Fi_Protected_Access
WPA (sometimes referred to as the draft IEEE 802.11i standard) became available in 2003. The Wi-Fi Alliance intended it as an intermediate measure in anticipation of the availability of the more secure and complex WPA2, which became available in 2004 and is a common shorthand for the full IEEE 802.11i (or IEEE 802.11i-2004) standard.
NEW QUESTION # 52
If you wished to see a list of revoked certificates from a CA, where would you look?
- A. CRL
- B. RA
- C. CA
- D. RFC
Answer: A
Explanation:
CRL
https://ru.wikipedia.org/wiki/Certificate_Revocation_List
Certificate Revocation List (or CRL) is "a list of digital certificates that have been revoked by the issuing certificate authority (CA) before their scheduled expiration date and should no longer be trusted".
Incorrect answers:
RA - Used to proxy the certificate requests on behalf of the user and validate whether or not they are legitimate instead of having the user go directly to the CA. The RA talks to the subordinate CA on behalf of the user, which makes it harder for the actor to get directly to the certificate authority and do harm.
RFC - Request for Comments (RFC) is a publication from the Internet Society (ISOC) and its associated bodies, most prominently the Internet Engineering Task Force (IETF), the principal technical development and standards-setting bodies for the Internet.
CA - certificate authority or certification authority is an entity that issues digital certificates
NEW QUESTION # 53
A type of frequency analysis used to attack polyalphabetic substitution ciphers. It's used to try to discover patterns and use that information to decrypt the cipher.
- A. Kasiski Method
- B. Birthday Attack
- C. Integral Cryptanalysis
- D. Information Deduction
Answer: A
Explanation:
Kasiski Method
https://en.wikipedia.org/wiki/Kasiski_examination
In cryptanalysis, Kasiski examination (also referred to as Kasiski's test or Kasiski's method) is a method of attacking polyalphabetic substitution ciphers, such as the Vigenere cipher. It was first published by Friedrich Kasiski in 1863, but seems to have been independently discovered by Charles Babbage as early as 1846.
Incorrect answers:
Integral Cryptanalysis - uses lots of sets of plaintext that are similar with slight modifications. These are encrypted and then the variations are analyzed to determine if there's anything that can be zeroed in on.
Information Deduction - the attacker gains some Shannon information about plaintexts (or ciphertexts) not previously known.
Birthday Attack - cryptographic attack that exploits the mathematics behind the birthday problem in the probability theory forces collisions within hashing functions.
NEW QUESTION # 54
......
EC-COUNCIL 212-81: Certified Encryption Specialist certification is recognized globally and is highly valued by organizations seeking to secure their data. Certified Encryption Specialist certification provides a competitive edge to the candidate and opens up many career opportunities in the field of cybersecurity. Certified Encryption Specialist certification also provides a solid foundation for higher-level certifications such as the Certified Ethical Hacker (CEH) and Certified Network Defense Architect (CNDA).
Regular Free Updates 212-81 Dumps Real Exam Questions Test Engine: https://examcollection.vcetorrent.com/212-81-valid-vce-torrent.html