Scribd
Upload
20 views

Tutorial 8 Discussion Document - Batch 04

The document discusses RSA encryption and digital signatures. It provides examples of calculating the encryption and decryption keys for small values of n, and multiplying prime numbers p and q to calculate the modulus n. It also gives an example of Alice signing a message to Bob using her private key and Bob verifying the signature with Alice's public key.

Uploaded by

Anindya Costa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Tutorial 8 Discussion Document - Batch 04

The document discusses RSA encryption and digital signatures. It provides examples of calculating the encryption and decryption keys for small values of n, and multiplying prime numbers p and q to calculate the modulus n. It also gives an example of Alice signing a message to Bob using her private key and Bob verifying the signature with Alice's public key.

Uploaded by

Anindya Costa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial 8 discussion – batch 04

p = 3; q = 11

3 = 0000 0011

11 = 0000 1011

p x q = 3 x 11 = 33 = 0010 0001

0 = 0000 0000

255 = 1111 1111

253 = 1111 1101

If p = 253, q= 253; p x q = 253 x 253 = 64,009 = 1111 1010 0000 1001

gcd(ø(n), E) = 1; 1< E < ø(n)

gcd (20, 7) = 1; E can take a value 3, 7, 9, 11, 13, 17, 19.

So, we take E = 3

(D x E) mod ø(n) = 1

(D x 3) mod 20 = 1

(7 x 3) mod 20 = 1

So, D = 3

1) Suppose your RSA modulus is n = 77 and your decryption key d = 11, Find the encryption
key e. Is this possible for large values of n say of the order of 1024 bits? Give your reasons in one or
two lines.

As d is given, we need to apply the formula (D x E) mod ø(n) = 1.

ø(n) = (p-1)(q-1) = 6 x 10 = 60

(11 x E) mod 60 = 1

(11 x 11) mod 60 =1

E = 11.
2) Alice wishes to send an authenticated message M = 5 to Bob using RSA algorithm where Alice’s
public key n = 33, e = 3 and private key d = 7. Derive the signature that would be used by Alice.
Explain how Bob would verify Alice’s signature.

As = MD mod N

= 57 mod 33

= 14

Bv = AsE mod N

= 143 mod N

=5

(Meaning the authenticated message should have been signed by Alice and by nobody else . In
cryptography, we call this as non-repudiation. Meaning, the sender cannot deny that it is not his/her
signature.)

You might also like