Given the following table describing the procedure for Alice to send a signed message with RSA signature to Bob, calculate the unknown entities and verify that Bob has received the correct message sent by Alice. Fill in the values of the "???" below.  Alice Bob Public key (n,e) =(55,3); Private key (n,d)=(55,27)   Send Public key (n,e ) to Bob: Receives Alice’s public key (n,e): Message to be sent is m=3   Computes signatures s for m = mdmod n = ???   Send (m,s) to Bob Receives (m,s) = ???   Compute m’ : se mod n = ??? b.Elgamal Signature Scheme: Given the following table describing the procedure for Alice to send a signed message with Elgamal signature to Bob, calculate the unknown entities and verify that Bob has received the correct message sent by Alice. Fill in the values of the "???" below.  Alice Bob Chooses p=23   Chooses a primitive element α=7   Choose a random integer d=6   Compute β = αd mod p = ???   Public key is kpub = (p, α, β) = ??? Private key is kpr, where d = 6   Send Public key kpub = (p, α, β) to Bob: ??? Receives Alice’s public key kpub = (p, α, β) = ??? Choose an ephemeral key KE = 5   Message to send is m=10   Computes signatures (s,r) for m r= αKE mod p = ??? Compute KE-1mod (p-1) = ??? s= (m-d*r)* KE-1 mod (p-1) = ???   Send (m, (r,s)) to Bob: ??? Receives (m, (r,s)) = ???   Compute t = βr * rs mod p = ???   Verifies if  t = αm mod p = ???

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Given the following table describing the procedure for Alice to send a signed message with RSA signature to Bob, calculate the unknown entities and verify that Bob has received the correct message sent by Alice. Fill in the values of the "???" below. 

Alice

Bob

Public key (n,e) =(55,3); Private key (n,d)=(55,27)

 

Send Public key (n,e ) to Bob:

Receives Alice’s public key (n,e):

Message to be sent is m=3

 

Computes signatures s for m = mdmod n = ???

 

Send (m,s) to Bob

Receives (m,s) = ???

 

Compute m’ : se mod n = ???

b.Elgamal Signature Scheme: Given the following table describing the procedure for Alice to send a signed message with Elgamal signature to Bob, calculate the unknown entities and verify that Bob has received the correct message sent by Alice. Fill in the values of the "???" below. 

Alice

Bob

Chooses p=23

 

Chooses a primitive element α=7

 

Choose a random integer d=6

 

Compute β = αd mod p = ???

 

Public key is kpub = (p, α, β) = ???

Private key is kpr, where d = 6

 

Send Public key kpub = (p, α, β) to Bob: ???

Receives Alice’s public key kpub = (p, α, β) = ???

Choose an ephemeral key KE = 5

 

Message to send is m=10

 

Computes signatures (s,r) for m

r= αKE mod p = ???

Compute KE-1mod (p-1) = ???

s= (m-d*r)* KE-1 mod (p-1) = ???

 

Send (m, (r,s)) to Bob: ???

Receives (m, (r,s)) = ???

 

Compute t = βr * rs mod p = ???

 

Verifies if  t = αm mod p = ???

 

c.Given the following table describing the procedure for Alice to send a signed message with DSA signature to Bob, calculate the unknown entities and verify that Bob has received the correct message sent by Alice. Here, for simplicity we assume that the hash of a message m, h(m) is already computed and given to you. Fill in the values of the "???" below. 

Alice

Bob

Choose p=19, q=7, α=2, d=6

 

Compute β= αd mod p = ???

 

Public key: kpub = (p,q,α,β) = ???

Private key: kprivwhere d = 6

 

Send public key to Bob: (p,q,α,β) = ???       

 

Hash of message m , h(m) = 7 (given)

Receive Alice’ public key (p,q,α,β) = ???

Ephemeral key, kE = 5

 

Compute kE-1 mod q = ???

 

Compute r= (αkE  mod p) mod q = ???

 

Compute s= (h(m) + d*r)* kE-1mod q = ???

 

DSA Signature (r,s) = ???

 

Send message (m, (r,s)) to Bob

 

 

Receive message (m, (r,s)) from Alice; here we assume h(m)=7 as known

 

Compute w = s-1mod q = ???

 

Compute u1 = w*h(m) mod q = ???

 

Compute u2 = w*r mod q = ???

 

Compute ν= (αu1* βu2 mod p) mod q = ???

 

Verification: compute µ = r mod q = ???

 

 

Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Encryption and decryption
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education