/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q28E In an RSA cryptosystem, p = 7聽a... [FREE SOLUTION] | 91影视

91影视

Log out

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鈥檚, 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.

Over 30 million students worldwide already upgrade their learning with 91影视!

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 if a has a multiplicative inverse modulo N, then this inverse is unique (modulo N).

A positive integer N is a power if it is of the formqk , where q,role="math" localid="1658399000008" k are positive integers and k>1.

(a) Give an efficient algorithm that takes as input a number and determines whether it is a square, that is, whether it can be written asq2 for some positive integer q. What is the running time of your algorithm?

(b) Show that if N=qk (with role="math" localid="1658399171717" N,q , andk all positive integers), then either role="math" localid="1658399158890" k鈮�logNorN=1.

(c) Give an efficient algorithm for determining whether a positive integerN is a power. Analyze its running time.

Find the inverse of:.20mod79,3mod62,21mod91,5mod23

1.36. Square roots. In this problem, we'll see that it is easy to compute square roots modulo a prime pwith p鈮�3(mod4).
(a) Suppose p鈮�3(mod4). Show that(p+1)/4 is an integer.
(b) We say x is a square root of a modulo p if a=x2(modp). Show that if p鈮�3(mod4)and if a has a square root modulo p, thena(p+1)/4 is such a square root.

Digital signatures, continued.Consider the signature scheme of Exercise 1.45.

(a) Signing involves decryption, and is therefore risky. Show that if Bob agrees to sign anything he is asked to, Eve can take advantage of this and decrypt any message sent by Alice to Bob.

(b) Suppose that Bob is more careful, and refuses to sign messages if their signatures look suspiciously like text. (We assume that a randomly chosen message鈭�that is, a random number in the range{1,...,N-1} is very unlikely to look like text.) Describe a way in which Eve can nevertheless still decrypt messages from Alice to Bob, by getting Bob to sign messages whose signatures look random.
See all solutions

Recommended explanations on Computer Science Textbooks

Functional Programming

Read Explanation

Computer Network

Read Explanation

Cybersecurity in Computer Science

Read Explanation

Game Design in Computer Science

Read Explanation

Computer Organisation and Architecture

Read Explanation

Problem Solving Techniques

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.