Consider an RSA key set with p = 17 , q = 23, N = 23 and e = 3 (as in Figure 1.9). What value of d should be used for the secret key? What is the encryption of the message M = 41 ?

Short Answer

Expert verified

Encryption message for is M = 41 is 105 mod 391 , and the value of d is -117.

Step by step solution

01

Introduction

RSA cryptosystem is an asymmetric cryptography algorithm that contains a public as well as a private key. With the use of both the keys, data get more secured and for decryption, the public can be visible to everyone but the private key is shared with the authorized user secretly.

02

Find the value of  

We have, p = 17 , q = 23 , n = 391 and e = 3.

We need to calculate,

(p=1)×(q-1)=(17-1)×(23-1)=16×22=352

To find the inverse of e m od 352 , calculate GCD ( 3,352 ).

As, 352=3×117,1, then

GCD ( 3,352 ) = 1

So, if GCD of any two number equals to one then we can do inverse of the given number.

So, inverse of 3 m od 352

e×d=1mod3523×d=1mod352d=-117

Therefore, the value of d is -117.

03

Encryption message

It is given that, M=41. Then,

EM=MemodN=413=117×41=105mod391

So, Encryption message for M = 41 is 105 mod 391.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

On page 38, we claimed that since about a 1nfraction of n-bit numbers are prime, on average it is sufficient to draw O(n)random n -bit numbers before hitting a prime. We now justify this rigorously. Suppose a particular coin has a probability p of coming up heads. How many times must you toss it, on average, before it comes up heads? (Hint: Method 1: start by showing that the correct expression isi=1i(1-p)i-1p . Method 2: if E is the average number of coin tosses, show that E=1+(1-p)E).

Consider the problem of computing x y for given integers x and y: we want the whole answer, not modulo a third integer. We know two algorithms for doing this: the iterative algorithm which performs y − 1 multiplications by x; and the recursive algorithm based on the binary expansion of y. Compare the time requirements of these two algorithms, assuming that the time to multiply an n-bit number by an m-bit number is O(mn).

Give a polynomial-time algorithm for computing,abcmodp given a,b,c, and prime p.

Show that log(n!)=θ(nlogn)

(Hint: To show an upper bound, compare (n!) with nn. To show a lower bound, compare it with (n2)n2).

1.37. The Chinese remainder theorem.
(a) Make a table with three columns. The first column is all numbers from 0 to 14. The second is the residues of these numbers modulo 3; the third column is the residues modulo 5. What do we observe?
(b) Prove that if p and q are distinct primes, then for every pair (j, k) with 0j<qand 0k<q, there is a unique integer 0i<pqsuch thatijmodp andikmodq. (Hint:
Prove that no two different i's in this range can have the same (j, k), and then count.)
(c) In this one-to-one correspondence between integers and pairs, it is easy to go from i to (j, k). Prove that the following formula takes we the other way:
i={j.qq-1modp+kpp-1modq}modpq
(d) Can we generalize parts (b) and (c) to more than two primes?

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free