Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
16.5.3. Parameter Generation Algorithm
This section
Practice test
12 questions on this section. Wrong answers show you what to read again.
Sign up to take itWhole chapter
Revision test
Mixed questions from across the chapter. Your answers get marked.
Sign up to take itQuick
Flashcard drill
3 cards from this lesson. Good the night before a test.
Try these first
- 1.
What is public key cryptography?
Hint
Think about how public keys differ from private keys.
- 2.
Name one advantage of public key cryptography over symmetric key cryptography.
Hint
Consider the challenges of key sharing.
- 3.
What does RSA stand for?
- Rivest-Shamir-Adleman
- Rivest-Smith-Algorithm
- Random-Secure-Algorithm
Hint
Think about the creators of the RSA algorithm.
- 4.
True or False: The private key in a public key system can be shared publicly.
- True
- False
Hint
Consider the consequences of sharing the private key.
- 5.
If Alice selects two prime numbers, 61 and 53, calculate the modulus N and the totient φ(N).
Hint
Use the formula for totient: φ(N) = (p-1)(q-1).
- 6.
Using the RSA algorithm, if e is chosen as 17, what can you say about choosing e in relation to φ(N)?
Hint
Factor φ(N) and determine coprimality.
Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
4 more questions available
Enrol freeQuiz
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
2 more questions available
Enrol freeChallenge Problems
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting