Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 1: Q28E (page 49)

In an RSA cryptosystem, p = 7and q = 11(as in Figure 1.9). Find appropriate exponents and .

Short Answer

Expert verified

The correct exponent of d is 37 and e is 13.

Step by step solution

01

Introduction

RSA cryptosystem are asymmetric cryptography algorithm in which it contains public as well as private key. By the use of both the keys data get more secured and for decryption public can be visible to everyone but private key is shared with the authorized user secretly.

02

Find the value of  

We have given that, p = 7 , q = 11 , n =p×q,

Then

n=7×11=77

Now, find ϕ(n)=(p-1)×(q-1).

ϕ(n)=(p-1)×(q-1)=(7-1)×(11-1)=6×10=60

Let’s, assume e as private key, such that

(e×d)modphi(n)=1

The value of e is 13 as it is the next prime number after 11

So,

(13×d)mod60=1d=37

The correct exponent of d is 37 and e is 13.

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.

Start your free trial

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

Show that any binary integer is at most four times as long as the corresponding decimal integer. For very large numbers, what is the ratio of these two lengths, approximately?

Give an efficient algorithm to compute the least common multiple of two n-bit numbers x and y, that is, the smallest number divisible by bothx and y. What is the running time of your algorithm as a function of n?

Is 41536-94824 divisible by35 ?

If p is prime, how many elements of{0,1,...pn-1} have an inverse modulopn ?

What is the least significant decimal digit of (1717)17? (Hint: For distinct primesp,q, and any a is not equal to role="math" localid="1658726105638" a≢0(modpq), we proved the formula role="math" localid="1658726171933" a(p-1)≡1(modpq)in Section 1.4.2.)
See all solutions

Recommended explanations on Computer Science Textbooks

Algorithms in Computer Science

Read Explanation

Computer Network

Read Explanation

Functional Programming

Read Explanation

Game Design in Computer Science

Read Explanation

Data Representation in Computer Science

Read Explanation

Computer Organisation and Architecture

Read Explanation
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