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






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






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


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






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






6. Drawback of this is that the hash is passed unencrypted and is susceptible to PSK crack attacks.






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






8. Provides authentication and encryption of the payload.






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






10. More CPU intensive






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






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






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






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






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






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






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






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






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






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






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






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






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


24. Common key size is 1024 bits.






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






26. IPsec implements using a shim header between L2 and L3






27. DoS attacks are more probable with this mode.






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






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






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






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






32. Used in IPsec for two discreet purposes:






33. Uses protocol number 51.






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






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






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






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






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






39. 'defines the mode of communication - creation - and management of security associations.'






40. A






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






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






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






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






45. One of the most popular tunneling protocols is






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






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






48. 'in most cases - this mode is preferred with certificates.'






49. Turns clear-text data into cipher text with an encryption algorithm. The receiving station decrypts the data from cipher text into clear text. The encryption key is a shared secret key that encrypts and decrypts messages.






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