Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

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

Is the difference of 530,000and6123,456a multiple of31 ?

Alice and her three friends are all users of the RSA cryptosystem. Her friends have public keys (Ni,ei=3),i=1,2,3 where as always,Ni=piqi for randomly chosen n-bit primes piqi. Showthat if Alice sends the same n-bit message M (encrypted using RSA) to each of her friends, then anyone who intercepts all three encrypted messages will be able to efficiently recover M.
(Hint: It helps to have solved problem 1.37 first.)

What is 222006(mod3)?

1.38. To see if a number, say 562437487, is divisible by 3, you just add up the digits of its decimalrepresentation, and see if the result is divisible by role="math" localid="1658402816137" 3.

( 5+6+2+4+3+7+4+8+7=46, so it is not divisible by 3).

To see if the same number is divisible by 11, you can do this: subdivide the number into pairs ofdigits, from the right-hand end(87,74,43,62,5) , add these numbers and see if the sum is divisible by11 (if it's too big, repeat).

How about 37? To see if the number is divisible by 37, subdivide it into triples from the end(487,437,562) add these up, and see if the sum is divisible by37 .


This is true for any prime pother than2 and 5. That is, for any prime p≠2,5, there is an integer rsuch that in order to see ifp divides a decimal number n, we breakn into r-tuples of decimal digits (starting from the right-hand end), add up these r-tuples, and check if the sum is divisible by p.

(a) What is the smallest rsuch for p=13? Forp=13 ?

(b) Show thatr is a divisor of p-1.

The Fibonacci numbers F0,F1,...are given by the recurrenceFn+1=Fn+Fn-1,F0=0,F1=1. Show that for anyn1,gcd(Fn+1,Fn)=1.

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