RSA is a common algorithm used to generate Asymmetric keys. Let’s look at an example using two small prime numbers. Let p = 3 (The 1st prime

RSA is a common algorithm used to generate Asymmetric keys. Let’s look at an example using two small prime numbers.

Let p = 3 (The 1st prime number)

Let q = 11 (The 2nd prime number)

Now compute N = p X q = 33

Compute z = (p -1)(q-1) = (3 – 1)(11 – 1) = 20

Now pick a number e such that 1 < e < z (e has to be prime)

Pick E = 7

Now compute

(D x E) mod Z ) = 1 (Pick some number d). An example for d = 3

(3 x 7) mod 20 = 1 (Satisfies the equation)

The keys are:

                (D, N)

                (E, N)

And in our case

                Encryption Key = (3, 33)

                Decryption Key = (7, 33)

Now for this discussion, you are going to use two prime number p and q and find the following

1. N

2. Z

3. D

4. Now PICK E

Rubric

Requirement

Correct

Partially Correct

Compute N

30%

15%

Compute Z

30%

15%

FOUND D

35%

20%

Share This Post

Email
WhatsApp
Facebook
Twitter
LinkedIn
Pinterest
Reddit

Order a Similar Paper and get 15% Discount on your First Order

Related Questions

Assignment Prompts:What are the differences between job involvement, organizational commitment, and job satisfaction? Are all three influenced by the

Assignment Prompts: What are the differences between job involvement, organizational commitment, and job satisfaction? Are all three influenced by the same factors? What are the major reasons for job satisfaction? What are the primary consequences of dissatisfaction? Explain Why is it important for managers to understand individual differences at work?