212-81 EC-COUNCIL
Rate this post

Updated Free EC-COUNCIL 212-81 Test Engine Questions with 200 Q&As

The Best ECES 212-81 Professional Exam Questions

EC-COUNCIL 212-81 Exam Syllabus Topics:

Topic Details
Topic 1
  • Symmetric Cryptography & Hashes
  • Single Substitution Weaknesses
Topic 2
  • Symmetric Block Cipher Algorithms
  • Basic Facts of the Feistel Function
Topic 3
  • Server-based Certificate Validation Protocol
  • Classification of Random Number Generator
Topic 4
  • Birthday Paradox: Probability
  • Mono-Alphabet Substitution
Topic 5
  • Information Theory Cryptography Concepts
  • Multi-Alphabet Substitution
Topic 6
  • Propagating Cipher-Block Chaining (PCBC)
  • Naor-Reingold and Mersenne Twister Pseudorandom Function
Topic 7
  • Shiva Password Authentication Protocol (S-PAP)
  • Challenge-Handshake Authentication Protocol (CHAP)
Topic 8
  • Point-to-Point Tunneling Protocol (PPTP)
  • National Security Agency and Cryptography
Topic 9
  • Cracking Modern Cryptography
  • Example of Symmetric Stream Ciphers: PIKE
Topic 10
  • Introduction and History of Cryptography
  • Breaking the Vigenère Cipher

 

QUESTION 49
In which of the following password protection technique, random strings of characters are added to the password before calculating their hashes?

 
 
 
 

QUESTION 50
Which of the following asymmetric algorithms is described by U.S. Patent 5,231,668 and FIPS 186

 
 
 
 

QUESTION 51
The most widely used asymmetric encryption algorithm is what?

 
 
 
 

QUESTION 52
Jane is looking for an algorithm to ensure message integrity. Which of following would be an acceptable choice?

 
 
 
 

QUESTION 53
During the process of encryption and decryption, what keys are shared?

 
 
 
 

QUESTION 54
Algorithm that was chosen for the Data Encryption Standard, which was altered and renamed Data Encryption Algorithm.

 
 
 
 

QUESTION 55
Part of understanding cryptography is understanding the cryptographic primitives that go into any crypto system. A(n) _______ is a fixed-size input to a cryptographic primitive that is random or pseudorandom.

 
 
 
 

QUESTION 56
This algorithm was published by the German engineering firm Seimans in 1993. It is a software based stream cipher using Lagged Fibonacci generator along with a concept borrowed from the shrinking generator ciphers.

 
 
 
 

QUESTION 57
Which of the following was a multi alphabet cipher widely used from the 16th century to the early 20th century?

 
 
 
 

QUESTION 58
MD5 can best be described as which one of the following?

 
 
 
 

QUESTION 59
Basic information theory is the basis for modern symmetric ciphers. Understanding the terminology of information theory is, therefore, important. If a single change of a single bit in the plaintext causes changes in all the bits of the resulting ciphertext, what is this called?

 
 
 
 

QUESTION 60
A disk you rotated to encrypt/decrypt. Created by Leon Alberti. Similar technologies were used in the Enigma machine. Considered the forefather of modern encryption.

 
 
 
 

QUESTION 61
Bruce Schneier is a well-known and highly respected cryptographer. He has developed several pseudo random number generators as well as worked on teams developing symmetric ciphers. Which one of the following is a symmetric block cipher designed in 1993 by Bruce Schneier team that is unpatented?

 
 
 
 

QUESTION 62
Storing private keys with a third party is referred to as what?

 
 
 
 

QUESTION 63
Which of the following is a block cipher?

 
 
 
 

QUESTION 64
Hash algortihm created by the Russians. Produces a fixed length output of 256bits. Input message is broken up into 256 bit blocks. If block is less than 256 bits then it is padded with 0s.

 
 
 
 

QUESTION 65
Fred is using an operating system that stores all passwords as an MD5 hash. What size is an MD5 message digest (hash)?

 
 
 
 

QUESTION 66
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.

 
 
 
 

QUESTION 67
Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.

 
 
 
 

Try 100% Updated 212-81 Exam Questions [2022]: https://www.examstorrent.com/212-81-exam-dumps-torrent.html

         

Related Links: www.stes.tyc.edu.tw myportal.utt.edu.tt myportal.utt.edu.tt myportal.utt.edu.tt myportal.utt.edu.tt myportal.utt.edu.tt

admin

Leave a Reply

Your email address will not be published. Required fields are marked *

Enter the text from the image below