Practice Conclusion (18.5) - Key Agreement and Secure Communication - Discrete Mathematics

Practise this section

8 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is symmetric key encryption?
Show hintHide hint
Think about the lock and key analogy.
Question 2.
Give an example of plaintext.
Show hintHide hint
What does a message look like before it is scrambled?
3Question 3.
What type of encryption uses the same key for both encrypting and decrypting?
- Asymmetrical Encryption
- Symmetric Key Encryption
- Hash Encryption
Show hintHide hint
Think of the lock and key analogy.
4Question 4.
Is it possible for two parties to establish a common key over a public channel?
- True
- False
Show hintHide hint
What did we learn about Diffie and Hellman's contributions?
Question 5.
Explain how an attacker might try to break symmetric key encryption and what measures can be taken to protect against such attacks.
Show hintHide hint
Consider what makes a key difficult to guess.
Question 6.
Using what you've learned about Diffie-Hellman, create a simplified example step-by-step showing how Sita and Ram agree on a key.
Show hintHide hint
Focus on the steps needed for agreement and remind yourself of what they exchange.

4 more questions in this section. Enroll free to practise them all.