GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
19 views

In RSA public key cryptosystem suppose n = p ∗ q where p and q are primes. (e, n) and (d, n) are public and private keys respectively. Let M be an integer such that o < M < n and φ(n) = (p – 1) (q – 1).

Which of the following equations represent RSA public key cryptosystem ?

I. C ≡ Me (mod n)

   M ≡ (C)d (mod n)

II. ed ≡ 1(mod n)

III. ed ≡ 1(mod φ(n))

IV. C ≡ Me(mod φ(n))

     M ≡ Cd(mod φ(n))

Codes :

(1) I and II         (2) I and III         (3) II and III         (4) I and IV

asked in Computer Networks by Loyal (3.2k points) 4 44 | 19 views

1 Answer

0 votes

In RSA algorithm

1) Cipher text is obtained as $Cipher Text = (Plain Text)^{public\ key} \ mod n$

2) Plain Text is obtained as $Plain Text = (Cipher Text)^{private\ key} \ mod n$

3) e should be chosen in such a way that it satisfy $e*d = 1(mod)\phi (n)$

Hence option (2) is correct

answered by Boss (5.2k points) 2 34 84


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23488 Points

  2. Bikram

    17108 Points

  3. Habibkhan

    8682 Points

  4. srestha

    6314 Points

  5. Debashish Deka

    5458 Points

  6. jothee

    5068 Points

  7. Sachin Mittal 1

    4882 Points

  8. joshi_nitish

    4444 Points

  9. sushmita

    3996 Points

  10. Rishi yadav

    3868 Points


Recent Badges

Photogenic MiNiPanda
Reader Ali Jazib Mahmood
Good Question Ishrat Jahan
Nice Comment Arjun
Notable Question Kaifi7
Popular Question LORD ofKINGS
Great Question Rucha Shelke
Popular Question rahul sharma 5
Popular Question jothee
Popular Question Pankaj Joshi
27,351 questions
35,209 answers
84,265 comments
33,328 users