- 3.2.1 What is RSA?
- 3.2.2 Why use RSA rather than DES?
- 3.2.3 How fast is RSA?
- 3.2.4 How much extra message length is caused by using RSA?
- 3.2.5 What would it take to break RSA?
- 3.2.6 Are strong primes necessary in RSA?
- 3.2.7 How large a modulus (key) should be used in RSA?
- 3.2.8 How large should the primes be?
- 3.2.9 How does one find random numbers for keys?
- 3.2.10 What if users of RSA run out of distinct primes?
- 3.2.11 How do you know if a number is prime?
- 3.2.12 How is RSA used for encryption in practice?
- 3.2.13 How is RSA used for authentication in practice?
- 3.2.14 Does RSA help detect altered documents and transmission errors?
- 3.2.15 What are alternatives to RSA?
- 3.2.16 Is RSA currently in use today?
- 3.2.17 Is RSA an official standard today?
- 3.2.18 Is RSA a de facto standard? Why is a de facto standard important?
- 3.2.19 Is RSA patented?
- 3.2.20 Can RSA be exported from the U.S.?