CRYPTOSYSTEM

ICE BREAKER
asciitable.com
Crack the code:
54 6F 64 61 79 // 69 77 69 6C 6C // 70
61 73 73 74 68 69 73 // 64 61 79 // 77
69 74 68 61 // 73 6D 69 6C 65 6F 6E //
60 79 66 61 63 65 // 49 6D 69 67 68 74
// 66 61 69 62 75 74 // 69 77 69 6C 6C
// 6E 65 76 65 72 // 67 69 76 65 75 70
// 47 6F 64 77 69 6C 6C // 67 75 69 64
65 75 73 // 61 6C 6C 2E
Answer:
Today // I will pass // this
day // with a // smile on //
my face // I might // fail but
// I will // never // give up
// God will // guide us // all.
CRYPTOSYSTEM
• A cryptosystem is pair of
algorithms that take a key
and convert plaintext to
ciphertext and back
• Its goal is to relay an
information from one place to
another without anyone else
being able to read it.
OBJECTIVES OF
ENCRYPTION
CONFIDENTIALITY
The sender (let us call
her Alice) and receiver
(let us call him Bob)
can be assured that no
third party can read the
message.
INTEGRITY
Alice and Bob can
be sure that no
third party can
make changes in
the message.
AUTHENTICITY
Bob can be
sure that it is
Alice who sent
the message.
NON-REPUDIATION

Bob can prove to

any third party
that Alice sent the
message.
ENCRYPTION
Encryption is the
process of using an
algorithm to transform
information into a
format that cannot be
read.
DECRYPTION
Decryption is the
process of using
another algorithm to
transform encrypted
information back into a
readable format.
MODULAR ARITHMETIC
The mathematical statement
a ≡ b (mod n)
(read as “a is congruent to b
modulo n)
means that the difference a – b
is divisible by the integer n.
EXAMPLES
1. 8 ≡ 2 (mod 3) since the
number 8 – 2 = 6 is
divisible by 3
2. 0 ≡ 24 (mod 6) since 0 –
24 = – 24 is divisible by 6
SOME PROPERTIES
1. a ≡ a (mod n)
2. a ≡ b (mod n) implies b ≡
a (mod n)
3. a ≡ b (mod n) and b ≡ c
(mod n) implies a ≡ c
(mod n)
QUIZ
Find x such that
1. 14 ≡ x (mod 5)
2. x ≡ 14 (mod 5)
3. 15 ≡ x (mod 23)
4. 20 ≡ x (mod 8)
5. 23 ≡ x (mod 5)
QUIZ
Find x such that
6. x ≡ 50 (mod 3)
7. x ≡ 3 (mod 5)
8. x ≡ 4 (mod 5)
9. x ≡ 5 (mod 5)
10.x ≡ 6 (mod 5)