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. Drawback of this is that the hash is passed unencrypted and is susceptible to PSK crack attacks.






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






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






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






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






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






7. DoS attacks are more probable with this mode.






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






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






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






11. The receiving device decrypts the data with the third key.






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






13. Uses protocol number 50.






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






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






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






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






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






19. The DES algorithm that performs 3 times sequentially.






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






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


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






23. 'MACs with hash algorithms -'






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






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






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






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






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






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






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






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






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






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






34. 'Encryption - where Peer X uses Peer Y






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






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






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






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






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






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






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






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






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






44. Does not provide payload encryption.






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


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






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






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






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






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