CSE
CSE IT3211
Consider the encryption scheme, where Alice chooses key \$ K=(p, q) \$ where \$ p \$ and \$ q \$ are primes and encrypts m using \$ E_k(m) = (m + r_1p, m +
View the step-by-step solution to:

Question

# <pre class="ql-syntax">Consider the encryption scheme, where Alice chooses key \$ K=(p, q) \$ where

\$ p \$ <span class="hljs-keyword">and</span> \$ q \$ are primes <span class="hljs-keyword">and</span> encrypts m using \$ E_k(m) = (m + r_1p, m + r_2q) \$ after choosing random number \$ r_1 \$ <span class="hljs-keyword">and</span> \$ r_2 \$. <span class="hljs-keyword">begin</span>{enumerate} item How will Alice decrypt the message? In other words, by looking at a ciphertext \$ (m + r_1p, m + r_2q) \$, how can Alice compute \$ m \$? item Is this a symmetric key cryptosystem <span class="hljs-keyword">or</span> a public key cryptosystem? Why? item Break the cryptosystem assuming that you are given two (plaintext, ciphertext) pairs <span class="hljs-keyword">end</span>{enumera </pre>

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents
• ### -  