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. Message of arbitrary length is taken as input and produces as output a 128-bit fingerprint or message digest of the input.






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


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






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






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






6. Uses IKE for key exchange.






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






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






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






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






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






12. More CPU intensive






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






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






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






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






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


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






19. Common key size is 1024 bits.






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






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






22. 'provides everything required to securely connect over a public media - such as the Internet.'






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






24. A






25. Is a two-phase protocol: The first phase establishes a secure authenticated channel and the second phase is where SAs are negotiated on behalf of the IPsec services.






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






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






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






29. Integrity checks are done

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


30. Used in IPsec for two discreet purposes:






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






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






33. 'has a Next Protocol field which identifies the next Layer 4 transport protocol in use - TCP or UDP'






34. 'Encryption - where Peer X uses Peer Y






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






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






37. Has a trailer which identifies IPsec information and ESP integrity-check information.






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






39. Uses protocol number 51.






40. One of the most popular tunneling protocols is






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. Does not provide payload encryption.






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






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






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






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






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






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






49. 'DSA is roughly the same speed as RSA when creating signatures - but 10 to 40 times slower when verifying signatures. Because verification happens more frequently than creation - this issue is worth noting when deploying DSA in any environment.'






50. 'MACs with hash algorithms -'