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






2. Uses IKE for key exchange.






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






4. One of the most popular tunneling protocols is






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






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






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






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






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






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






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






12. 'MACs with hash algorithms -'






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






14. Verify whether the data has been altered.






15. Key exchange for IPSEC






16. Common key size is 1024 bits.






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


18. Act of encapsulating a packet within another packet.






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






20. Does not provide payload encryption.






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






22. More CPU intensive






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






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






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






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






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






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






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






30. Integrity checks are done


31. Uses protocol number 51.






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






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






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






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






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






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






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






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






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






41. A






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






44. The DES algorithm that performs 3 times sequentially.






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






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






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






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






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






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