2,486 views
1 votes
1 votes
Using the RSA public key cryptosystem, with a = 1, b = 2 . . . y = 25, z = 26.
(a) If p = 5 and q = 13, list five legal values for d.

(b) If p = 5, q = 31, and d = 37, find e.
(c) Using p = 3, q = 11, and d = 9, find e and encrypt ‘‘hello’’.

2 Answers

0 votes
0 votes
a. p=5, q=13

    n=p*q=65

    $\Phi (n)$=(p-1)*(q-1)=48

    d(private key) should be chosen such that d and $\Phi (n)$ have no common factors(they are relatively prime)

    Possible choices for d=5,7,11,13,17

b. p=5, q=31 and d=37

    n=p*q=155

     $\Phi (n)$=(p-1)*(q-1)=120

     the following relation must hold

     e*d=1 MOD  $\Phi (n)$

     e*37=1 MOD 120

     e*37 could be 121, 241, 361, 481 and so on

     for here we obtain e=13

c.  p=3, q=11, d=9

     n=p*q=33

      $\Phi (n)$=(p-1)*(q-1)=20

      e*d=1 MOD  $\Phi (n)$

      e*9=1 MOD 20

      e=9

      for encryption $C=P^e MOD$ n

      hello=8, 5, 12, 12, 15

      h =>  $8^9 MOD$ 33=29

      e =>  $5^9 MOD$ 33=20

      l  =>  $12^9 MOD$ 33=12

      o =>  $15^9 MOD$ 33=3

Related questions

1.2k
views
1 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
1,151 views
Alice and Bob use RSA public key encryption in order to communicate between them.Trudy finds out that Alice and Bob shared one of the primes used to determine thenumber ... pb q. How can Trudy use this information to break Alice's code?
784
views
1 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
784 views
A math class has 25 students. Assuming that all of the students were born in the firsthalf of the year-between January 1st and June 30th- what is the ... ? Assume that nobody was born on leap day,so there are 181 possible birthdays.
490
views
0 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
490 views
Alice wants to communicate with Bob, using public-key cryptography. She establishesa connection to someone she hopes is Bob. She asks him for his public key andhe sends it ... who he is talking to(e.g., Bob is some kind of public service).
507
views
0 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
507 views
33. Two users can establish a shared secret key using the Diffie-Hellman algorithm, evenif they have never met, share no secrets, and have no certificates(a) ... middle attack.(b) How would this susceptibility change if n or g were secret?