Test your basic knowledge |

CCIE Sec Encryption Ipsec

Subjects : cisco, it-skills, ccie
Instructions:
  • Answer 50 questions in 15 minutes.
  • If you are not ready to take this test, you can study here.
  • Match each statement with the correct term.
  • Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. 'A 56-bit encryption algorithm - meaning the number of possible keys






2. You check it by hashing data and appending the hash value to the data as you send it across the network to a peer.






3. 'requires that the sender and receiver have key pairs. By combining the sender






4. Invented by Ron Rivest of RSA Security (RFC 1321).






5. 'including Internet Security Association and Key Management Protocol (ISAKMP) - Secure Key Exchange Mechanism for the Internet (SKEME) - and Oakley.'






6. 'is a block-cipher algorithm - which means that it performs operations on fixed-length data streams of 64-bit blocks. The key ostensibly consists of 64 bits; however - only 56 are actually used by the algorithm.'






7. Message of arbitrary length is taken as input and produces as output a 128-bit fingerprint or message digest of the input.






8. It uses UDP 500 and is defined by RFC 2409.






9. Integrity checks are done

Warning: Invalid argument supplied for foreach() in /var/www/html/basicversity.com/show_quiz.php on line 183


10. 'key lengths are 128 - 192 - or 256 bits to encrypt blocks of equal length.'






11. Does not provide payload encryption.






12. Data integrity is the process of making sure data is not tampered with while it






13. 'Message digest algorithms have a drawback whereby a hacker (man in the middle) can intercept a message containing the packet and hash values - then re-create and transmit a modified packet with the same calculated hash to the target destination.'






14. 'Developed in 1977 by Ronald Rivest - Adi Shamir - and Leonard Adleman (therefore - RSA).'






15. Hybrid protocol that defines the mechanism to derive authenticated keying material and negotiation of security associations (SA).






16. Common key size is 1024 bits.






17. RFC 2631 on the workings of the key generation/exchange process.






18. The sending device encrypts for a final time with another 56-bit key.






19. The receiving device then encrypts the data with the second key.






20. 'Encryption - where Peer X uses Peer Y






21. Act of encapsulating a packet within another packet.






22. This mode does not support identity protection or protection against clogging attacks and spoofing.






23. 'often called public-key algorithms - do not rely on a randomly generated shared encryption key; instead - they create two static keys. These static keys are completely different - but mathematically bound to each other; what one key encrypts - the o






24. Key exchange for IPSEC






25. ' is defined in RFC 3174. has as output a 160-bit value -'






26. A






27. Benefits are that the preshared authentication can be based on ID versus IP address and the speed of the process.






28. 'It is not used for encryption or digital signatures; it is used to obtain a shared secret






29. Used in government installs and was created to work with the SHA-1 hash algorithm.






30. 'Finally - the receiving devices decrypt the data with the first key.'






31. Origin authentication validates the origin of a message upon receipt; this process is done during initial communications.






32. 'produces a 160-bit hash output - which makes it more difficult to decipher.'






33. Verify whether the data has been altered.






34. 'is a more secure version of MD5 - and hash-based message authentication codes (HMAC) provides further security with the inclusion of a key-based hash.'






35. 'Three keys encrypt the data - which results in a 168-bit encryption key. The sending device encrypts the data with the first 56-bit key.'






36. Used in IPsec for two discreet purposes:






37. 'group 2 identifies a 1024-bit key - group 2 is more secure - but slower to execute.'






38. Uses the D-H algorithm to come to agreement over a public network.






39. Can be implemented efficiently on a wide range of processors and in hardware.






40. 'When using the hash-based key function -'






41. IPSEC Encryption is performed by

Warning: Invalid argument supplied for foreach() in /var/www/html/basicversity.com/show_quiz.php on line 183


42. Negotiation of the ISAKMP policy by offering and acceptance of protection suites

Warning: Invalid argument supplied for foreach() in /var/www/html/basicversity.com/show_quiz.php on line 183


43. It also provides protection for ISAKMP peer identities with encryption.






44. 'algorithm encrypts and decrypts data three times with 3 different keys - effectively creating a 168-bit key.'






45. Main mode establishes ISAKMP security association in six messages and performs authenticated D-H exchange.






46. Where the original Layer 3 header and payload inside an IPsec packet is encapsulated. Tunnel mode does add overhead to each packet and uses some additional CPU resources.






47. Uses protocol number 51.






48. IPSEC tunnels data through IP using one of two protocols?






49. 'The sending device decrypts the data with the second key - which is also 56 bits in length.'






50. 'Digital signatures. Peer X encrypts a hash value with his private key and then sends the data to Peer Y. Peer Y obtains Peer X