 # Encrypt the message 1010 using the textbook RSA and then prove the ...

## Question

Encrypt the message 1010 using the textbook RSA and then prove the decryption works as expected.
To select the two prime numbers p and q,use the last two pairs of digits from your student ID.

## Solution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

The message from plaintext is split in blocks of four digits, like 0(1010)(1010) and sent each block by padding.
ID=1023560 => p is the closest prime number of 35=> 37
Q is the closest prime number of 60, thus 61
Hence n=p*q=37*61=2257
Φ(n)= (p-1)*(q-1)=36*60=2160...

By purchasing this solution you'll be able to access the following files:
Solution.docx.

\$15.00
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

### Find A Tutor

View available Cryptography Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.