0% found this document useful (0 votes)
7 views

Exercise on decryption of RSA 2024

Some history and theories on the playfair cypher

Uploaded by

Davison Bunjira
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views

Exercise on decryption of RSA 2024

Some history and theories on the playfair cypher

Uploaded by

Davison Bunjira
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Cryptology, AFiB Vistula, 2021/2022

dr hab. inż. Włodzimierz Kałat

Exercise 4. Decryption of RSA ciphertext

Run of the Exercise


You get a ciphertext resulting from the operation of the RSA algorithm on the plaintext, the content of
which you are to restore. You also get some data on the basis of which you define the necessary para -
meters for the cipher encryption/decryption processes.

Following steps:
1. Use your ID’s digits to create the number according to the formula:
L = (ID1+ID3)100 + (ID2+ID4)10 + (ID3+ID5)
2. Find the leftmost prime number to L in the table below and consider it as p. If L is already prime
number, then p = L.
Table of prime numbers in the range up to 2000
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109,
113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233,
239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367,
373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499,
503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643,
647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797,
809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947,
953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,
1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201,
1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307,
1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453,
1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571,
1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697,
1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831,
1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979,
1987, 1993, 1997, 1999

3. The number q is predetermined and has the value 3.


4. Find the modulus n = pq.
5. Find the totient j(n).
6. Consider the given e as the part of public key.
7. Find d so that d = e-1 mod j(n) (the part of private key).

8. Calculate - where n is a modulus, and N - the length of alphabet narrowed


down to letters from A to P only (do not make a mistake while counting).
9. The pointer k denotes the number of letters of the plaintext block.
Use the programs A and B written in VBA for Excel language shown below, or 3in1.cwm application
in Cryptool 2.1 allowing to perform modular operations (abmod n, m-1 mod n and j(n)).

A screenshot of 3in1.cwm application modelled in Cryptool 2.1 environment.

1
Exemplary RSA decryption report

Student’s ID: 48357, then L = (4+3)100 + (8+5)10 + (3+7)1 = 700 + 130 + 10 = 840, given e = 3
Student’s ID: 99557, then L = (9+5)100 + (9+5)10 + (5+7)1 = 1400 + 140 + 120 = 1552, given e = 5
Modulus Totient Given Private key N = length of k – to find
L p
n = pq (n) public key e d = e-1 mod (n) alphabet like in step 8.
840 839 2517 1676 3 559 16 2
154
1552 4647 3096 5 2477 16 3
9
The course of decryption of cryptograms of two identical plaintexts, but with different values of number k.
if k = 2 if k = 3

ciphertext to be decrypted ekfhjhijf bchceg

blocks of ciphertext letters ekf hjh ijf bch ceg


(separated by space or | )
hexadecimal numbers of every
letter in ciphertext block 1) 4A5 797 895 127 246
(separated by space or | )
ci – decimal value of every
block from the cell above 2) 1189 1943 2197 295 582
(separated by space or | )
mi – decimal value of decryp-
tion ci d mod n 196 056 013 3139 2061
(separated by space or | )
hexadecimal values of every
decimal block 2) C4 38 0D C43 80D
(separated by space or | )
corresponding letters from the
table1)
me di an med ian
for k = 2 letter block for k = 3 letter block
(separated by space or | )

plaintext
letter by letter m e d i a n
1)
alphabet  character table
Dec 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Hex 0 1 2 3 4 5 6 7 8 9 A B C D E F
 a b c d e f g h i j k l m n o p

2)
link for quick conversion any numeral system ↔ any numeral system (especially hex ↔ dec)
Numeral Systems Converter (numeral-systems.com)
2023/2024

Grou
Surname Name ID number Acad. year
p

Decryption of RSA ciphertext

My numerical data
Modulus Totient Given Private key N = length of k – to find
L p
n = pq (n) public key e d = e-1 mod (n) alphabet like in step 8.

The course of decryption process


ciphertext to be decrypted
blocks of ciphertext letters
(separated by space or | )
hexadecimal numbers of every
letter in ciphertext block 1)
(separated by space or | )
ci – decimal value of every
block from the cell above 2)
(separated by space or | )
mi – decimal value of decryp-
tion ci d mod n
(separated by space or | )
hexadecimal values of every
decimal block 2)
(separated by space or | )
corresponding letters from the
table1)
(separated by space or | )

Plaintext
letter by letter

1)
alphabet  character table
Dec 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Hex 0 1 2 3 4 5 6 7 8 9 A B C D E F
 a b c d e f g h i j k l m n o p

2)
link for quick conversion any numeral system ↔ any numeral system (especially hex ↔ dec)
Numeral Systems Converter (numeral-systems.com)

Individual data are shown on the next page.

3
Grou
Surname Name ID number Acad. year
p

Introduction to Cryptology 25 65732 olpomo 7 25 65640 dbcnmbhfj 7


Group 1 26 Group
650642 efjdcdgdm 5 26 63879 kdgbbb 11
Nr ID ciphertextext key e Nr ID 27 65433
ciphertext key e
ealdjnapd 5 27 65008 fbagefeam 3
1 60309 fddahhdhk 3 1 6419728hfldkbidm
64457 haigjgfac5 3 28 64277 ggnefeedn 5
2 65557 behiamcof 7 2 5799229lpdieg 3
64442 kmmgejkhp 5 29 64267 dpigecbbi 5
3 65750 phdljn 5 3 6570930ioljkpabl
64803 jghijp3 11 30 65240 chcaghfil 3
4 64900 dpfoeo 7 4 6539531dpmghikoh 5
65683 cmpcgiklm 5 31 63956 eppeep 5
5 63669 abddcijbn 5 5 5962432ggoifgnep 3
64478 eliiajcgi 5 32 70403 fddhbdfon 3

6 63132 fipdclhkp 3 6 63248 gplgcbehl 5

7 65004 abnhddgdp 3 7 64775 ddnank 3


8 58384 bhgbgkkoe 5 8 64317 ifhjnkiee 3

9 65279 fddjoaagi 3 9 57158 hcofnfgdf 5

10 64275 higceihgi 3 10 64245 dajdnneke 3

11 64345 gihebcabl 3 11 63911 alcjmj 5

12 61732 haoljedcf 5 12 65493 delbmcjpk 5


13 63607 makjifmjc 5 13 64510 bbcgngkka 5
14 64051 cfehmfaem 7 14 61934 jbghoc 3
15 64830 eagdmf 13 15 59882 cnebeg 11

16 64626 jiggbncbe 3 16 65320 fjpgbbjhd 3

17 64739 nmbafl 7 17 64907 kgkbei 3

18 65140 dlbdpcclo 5 18 64224 jdjahkhid 3

19 64912 ckkphi 3 19 65664 gibgdnabl 3

20 64179 fkmijnecn 7 20 59494 lijaihkec 5

21 64468 enicnkmbn 3 21 63992 hdcglf 7

22 64215 hbmidejnp 3 22 64135 dpccjobbe 3


23 64828 eagdmf 17 23 64737 olpomo 7
24 61550 kkahkggah 3 24 61727 hbdfibonc 5

You might also like