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






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






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






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






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






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






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






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






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






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






11. Key exchange for IPSEC






12. A






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






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






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


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






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






18. IPSec SAs are negotiated and protected by the existing IPsec SA.






19. Does not provide payload encryption.






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






21. Common key size is 1024 bits.






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






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






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






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






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






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






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






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


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






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






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






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






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






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






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






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






38. One of the most popular tunneling protocols is






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






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






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






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






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






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






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






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






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






48. DoS attacks are more probable with this mode.






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






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