Scribd
Upload
10 views3 pages

RSA Detailed Solutions Student Updated

The document provides a detailed worksheet on RSA encryption, including step-by-step solutions for computing n and phi(n), finding the decryption key d, and performing encryption and decryption with given values. It covers multiple examples with different prime numbers and modulus values, demonstrating the RSA algorithm's processes. Each question is followed by its solution, illustrating the calculations involved in RSA encryption and decryption.

Uploaded by

hamedelblsey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views3 pages

RSA Detailed Solutions Student Updated

The document provides a detailed worksheet on RSA encryption, including step-by-step solutions for computing n and phi(n), finding the decryption key d, and performing encryption and decryption with given values. It covers multiple examples with different prime numbers and modulus values, demonstrating the RSA algorithm's processes. Each question is followed by its solution, illustrating the calculations involved in RSA encryption and decryption.

Uploaded by

hamedelblsey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

RSA Encryption - Advanced Practice Worksheet

Student-Friendly Detailed Solutions

Q1:

Compute n and phi(n) for p = 5, q = 11:

n = 5 x 11 = 55

phi(n) = (5 - 1) x (11 - 1) = 4 x 10 = 40

Q2:

Find d such that 7 x d == 1 mod 40:

Try d = 23 -> 7 x 23 = 161 -> 161 mod 40 = 1 => d = 23

Q3:

Encrypt M = 9 with e = 7 and n = 55:

C = 9^7 mod 55 = 4782969 mod 55 = 18

Q4:

Decrypt C = 18 with d = 23 and n = 55:

M = 18^23 mod 55 = 9

Q5:

Compute n and phi(n) for p = 7, q = 13:

n = 7 x 13 = 91

phi(n) = (7 - 1)(13 - 1) = 6 x 12 = 72

Q6:

Find d such that 5 x d == 1 mod 72:

Try d = 29 -> 5 x 29 = 145 -> 145 mod 72 = 1 => d = 29

Q7:

Encrypt M = 11 with e = 5 and n = 91:


C = 11^5 mod 91 = 161051 mod 91 = 11

Q8:

Encrypt M = 8 with e = 5 and n = 247:

C = 8^5 = 32768 -> 32768 mod 247 = 164

Q9:

Decrypt C = 164 with d = 29 and n = 247:

M = 164^29 mod 247 = 8

Q10:

Encrypt M = 10 with e = 3 and n = 391:

C = 10^3 = 1000 -> 1000 mod 391 = 218

Q11:

Decrypt C = 218 with d = 235 and n = 391:

M = 218^235 mod 391 = 10

Q12:

Compute n and phi(n) for p = 23, q = 31:

n = 23 x 31 = 713

phi(n) = (23 - 1)(31 - 1) = 22 x 30 = 660

Q13:

Find d such that 7 x d == 1 mod 660:

Try d = 283 -> 7 x 283 = 1981 -> 1981 mod 660 = 1 => d = 283

Q14:

Encrypt M = 12 with e = 7 and n = 713:

C = 12^7 mod 713 = 627

Q15:

Decrypt C = 627 with d = 283 and n = 713:


M = 627^283 mod 713 = 12

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy