Scribd
Upload
11 views1 page

19 Tut 2 Sol

The document contains tutorial exercises from a mathematics course on cybercrime, focusing on congruences, affine ciphers, exponential ciphers, and RSA cryptosystems. It includes specific problems with their solutions, such as finding nonnegative integers that satisfy given congruences, decrypting messages, and working with RSA encryption. Additionally, it explores properties of generators in modular arithmetic.

Uploaded by

Lucas Wee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

19 Tut 2 Sol

The document contains tutorial exercises from a mathematics course on cybercrime, focusing on congruences, affine ciphers, exponential ciphers, and RSA cryptosystems. It includes specific problems with their solutions, such as finding nonnegative integers that satisfy given congruences, decrypting messages, and working with RSA encryption. Additionally, it explores properties of generators in modular arithmetic.

Uploaded by

Lucas Wee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Department of Mathematics

National University of Singapore

(2018/2019) Semester 2 GEK1531 Introduction to Cybercrime Tutorial 2

(1) Find the smallest nonnegative integer x that satisfies the following congruence equa-
tions.
(i) 797 ≡ x mod 11. Ans: x = 5.
(ii) −36893 ≡ x mod 19. Ans: x = 5.
(iiv) 231345678 × 121439870 ≡ x mod 255. Ans: x = 150.
(iv) 524 ≡ x mod 29. Ans: x = 20.
(v) 23159 ≡ x mod 79. Ans: x = 1.
(vi) 8x ≡ 3 mod 47. Ans: x = 18.

(2) It is known that an affine cipher with key (23, 3) is used to encrypt a message. Decrypt
the message if the cipher text is:
Encryption function: f (x) = 23x + 3 mod 26. Decryption function: g(x) = 17x +
1 mod 26.
TOIDY Ans: MFHAT

(3) Using the exponential cipher f (x) = x3 mod 5259 that encipher two letters each time,
encipher the message:
Easy 4003 ≡ 3229 mod 5259, 18243 ≡ 2052 mod 5259.

(4) Find all the elements in the set Z∗35 .


{1, 2, 3, 4, 6, 8, 9, 11, 12, 13, 16, 17, 18, 19, 22, 23, 24, 26, 27, 29, 31, 32, 33, 34}.

(5) Show that 2 is a generator of Z∗13 and 3 is not a generator of Z∗13

(6) In the setting of RSA cryptosystem, we set n = 59 × 71 and the public key of Bob is
11, i.e. e = 11.
(i) Suppose Alice sent a message to Bob represented by a number 7. Find the
number that represents the ciphertext. Ans: 711 ≡ 1451 mod 4189.
(ii) Find the multiplicative inverse of 11 mod φ(n). Ans: 3691.
(iii) Suppose B received the ciphertext represented by the number 13. Find the
number that represent the plaintext given 133689 ≡ 2105 mod n.
Ans: 133691 ≡ 133689 · 132 ≡ 3869 mod 4189.

You might also like