Crypto
Crypto
Security
Cryptography
Protection
1
Security
User Authenticity.
Passwords.
Password Vulnerability.
Encrypted password.
One – Time Password.
Bio-metric.
Voice recognition.
3
System Threats
Worms
Viruses
Denial of Service
4
Unit - V
Cryptograp
hy
5
Topics Discussed in the Section
Security Goals
Attacks
Services
Techniques
6
Taxonomy of attacks with relation to security goals
7
Security Attacks - Confidentiality
10
Security Attacks - Availability
11
TRADITIONAL CIPHERS
Key
Substitution Ciphers
Transposition Ciphers
13
General idea of traditional cipher
14
Note
15
Symmetric-key: locking and unlocking with the same key
16
Locking and unlocking in asymmetric-key cryptosystem
17
Note
18
Representation of characters in modulo 26
19
Note
20
Example
Use the additive cipher with key = 15 to encrypt
the message “hello”.
Solution
We apply the encryption algorithm to the
plaintext, character by character. The result is
“WTAAD”. Note that the cipher is monoalphabetic
because two instances of the same plaintext
character (ls) are encrypted as the same
character (A).
21
Example
Use the additive cipher with key = 15 to decrypt
the message “WTAAD”.
Solution
We apply the decryption algorithm to the
plaintext character by character. The result is
“hello”. Note that the operation is in modulo 26,
which means that we need to add 26 to a
negative result (for example 15 becomes 11).
22
An example key for mono-alphabetic substitution cipher
23
Example
We can use the key in Figure 29.5 to encrypt the
message
The ciphertext is
24
Note
25
Transposition cipher
Plaintext Plaintext
e n emy a t t a c k s t o n i g h t z e n emy a t t a c k s t o n i g h t z
e n e m y e n e m y
a t t a c a t t a c
k s t o n k s t o n
i g h t z i g h t z
E E M Y N E E M Y N
T A A C T T A A C T
T K O N S T K O N S
H I T Z G H I T Z G
Read column by column Write column by column
E T T H E AK I MAO T Y C N Z N T S G E T T H E AK I MAO T Y C N Z N T S G
Ciphertext Ciphertext
Transmission
26
ASYMMETRIC-KEY CIPHERS
27
Topics Discussed in the Section
Keys
General Idea
RSA Cryptosystem
Applications
28
Note
29
Note
In symmetric-key cryptography,
symbols are permuted or substituted;
in asymmetric-key cryptography,
numbers are manipulated.
30
Note
31
Figure 29.14 General idea of asymmetric-key cryptosystem
To public
Key-generation
Public-key distribution procedure
channel
Encryption Decryption
Plaintext Ciphertext Insecure channel Ciphertext Plaintext
32
Figure 29.15 Encryption, decryption, and key Generation in RSA
Key calculation
(e, n) Select p, q
To public n=p×q
Select e and d
Private (d)
(e, n)
C: Ciphertext
P C = P e mod n P = C d mod n P
Plaintext Encryption Decryption Plaintext
33
Steps in RSA algorithm
35
Example
Here is a more realistic example calculated with a
computer. We choose a 512-bit p and q, calculate
n and φ(n), We then choose e and calculate d.
Finally, we show the results of encryption and
decryption. The integer p is a 159-digit number.
Internet
Banking
Credit card transactions..
40
Advantage of RSA algorithm
41