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. 'requires that the sender and receiver have key pairs. By combining the sender






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






3. ID exchange and authentication of D-H key by using the reply to the received nonce or string of bits

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


4. DoS attacks are more probable with this mode.






5. 'establishes ISAKMP SA in three messages -because it negotiates a ISAKMP policy and a DJ nonce exchange together.'






6. 'The messages are authenticated - and the mechanisms that provide such integrity checks based on a secret key are usually called'






7. '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.'






8. Common key size is 1024 bits.






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






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






11. No additional Layer 3 header is created. The original Layer 3 header is used.






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






13. 'can be achieved using one of three methods: preshared keys - encrypted nonces - or digital signatures.'






14. The protocol of choice for key management and establishing security associations between peers on the Internet.






15. You use this encryption method by keeping one key private and giving the other key to anyone in the public Internet. It does not matter who has your public key; it is useless without the private key.






16. 'group 1 identifies a 768-bit key - group 1 is faster to execute - but it is less secure -'






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






18. IPSEC performs this function by using a sequence field in the IPsec header combined with integrity checks.






19. That authenticate data packets and ensure that data is not tampered with or modified.






20. 'group 5 identifies a 1536-bit key - provides for highest security but is the slowest of all groups.'






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






22. '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.'






23. 'key exchange is vulnerable to a man-in-the-middle attack. You can rectify this problem by allowing the two parties to authenticate themselves to each other with a shared secret key - digital signatures - or public-key certificates.'






24. Used in IPsec for two discreet purposes:






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






26. '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






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






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






29. Uses protocol number 50.






30. Negotiation of a shared secret key for encryption of the IKE session using the D-H algorithm

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


31. 'Encryption - where Peer X uses Peer Y






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






33. Takes variable-length clear-text data to produce fixed-length hashed data that is unreadable.






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






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






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






37. Act of encapsulating a packet within another packet.






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






39. 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.






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






41. 'Created by NIST in 1994 - is the algorithm used for digital signatures but not for encryption.'






42. Provide authentication in Internet Key Exchange (IKE) Phase 2.






43. A variable block- length and key-length cipher.






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






45. 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


46. Used for integrity checks on peer and data sent by peer and for authentication checks.






47. Uses IKE for key exchange.






48. Uses protocol number 51.






49. Integrity checks are done

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


50. 'A 56-bit encryption algorithm - meaning the number of possible keys