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

RSA and digital signatures. Recall that in the RSA public-key cryptosystem, each user has a public key P=(N,e) and a secret key d. In a digital signature scheme, there are two algorithms, sign and verify. The sign procedure takes a message and a secret key, then outputs a signature σ. The verify procedure takes a public key (N,e), a signature σ, and a message M, then returns “true” if σcould have been created by sign (when called with message M and the secret key (N, e) corresponding to the public key ); “false” otherwise.

(a)Why would we want digital signatures?

(b) An RSA signature consists of sign, (M,d)=Md(modN)where d is a secret key and N is part of the public key . Show that anyone who knows the public key (N,e)can perform verify ((N,e),Md,M), i.e., they can check that a signature really was created by the private key. Give an implementation and prove its correctness.

(c) Generate your own RSA modulus, N=pq public key e, and private key d (you don’t need to use a computer). Pick p and q so you have a 4-digit modulus and work by hand. Now sign your name using the private exponent of this RSA modulus. To do this you will need to specify some one-to-one mapping from strings to integers in [0,N-1]. Specify any mapping you like. Give the mapping from your name to numbers m1,m2,...mk,then sign the first number by giving the value md1(modN), and finally show that .

(md1)e=m1(modN)

(d) Alice wants to write a message that looks like it was digitally signed by Bob. She notices that Bob’s public RSA key is (17,391). To what exponent should she raise her message?

Calculate 2125mod127using any method you choose. (Hint: 127 is prime.)

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

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 ?

Prove or disprove: If a has an inverse modulo b, then b has an inverse modulo a.
See all solutions

Recommended explanations on Computer Science Textbooks

Computer Organisation and Architecture

Read Explanation

Data Structures

Read Explanation

Issues in Computer Science

Read Explanation

Algorithms in Computer Science

Read Explanation

Computer Programming

Read Explanation

Big Data

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