Security

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 29

Network Security

Goals of Network Security

 Confidentiality
 Integrity
 Availability
Types of Threats in Network
 Interruption
 An asset of the system is destroyed
or becomes unavailable
 Attack on availability
 Destruction of hardware
 Cutting of a communication line
Types of Threats in Network
 Interception
 An unauthorized party gains access
to an asset
 Attack on confidentiality
 Illegal copying of files or programs
Types of Threats in Network
 Modification
 An unauthorized party not only
gains access but tampers with an
asset
 Attack on integrity
 Changing values in a data file
 Altering a program so that it
performs differently
Types of Threats in Network
 Fabrication
 An unauthorized party inserts
counterfeit objects into the system
 Attack on authenticity
 Insertion of spurious messages in a
network
Need for Security
 Some people who cause security
problems and why.
Cryptography
 Introduction to Cryptography
 Substitution Ciphers
 Transposition Ciphers
 One-Time Pads
Important Definition
 Plain Text - Message

 Cipher Text - Encrypted Message


 Encryption - Process of Converting Plain text to cipher
text
 Decryption - Reverse Process of Encryption

 Cryptography - Study of Different Algo. for encryption

 Cryptanalysis - Techniques used to decrypt the message


without knowledge of encrypting details
 Cryptology - The area of cryptography and
cryptanalysis together
An introduction to cryptography
 The encryption model (for a
symmetric-key cipher).
Substitution Technique

Caesar cipher
Earliest, Simplest
Used by Julius Caesar
Stream ciphers
C = P + K mod 26
P = C - K mod 26
Transposition Ciphers
 A transposition cipher.
One-Time Pads

The use of a one-time pad for encryption and the


possibility of getting any possible plaintext from
the ciphertext by the use of some other pad.
Data Encryption Standard

The data encryption standard. (a) General outline.


(b) Detail of one iteration. The circled + means exclusive
OR.
Triple DES
 (a) Triple encryption using DES. (b)
Decryption.
The Advanced Encryption Standard
1. Rules for AES proposals
2. The algorithm must be a symmetric block
cipher.
3. The full design must be public.
4. Key lengths of 128, 192, and 256 bits
supported.
5. Both software and hardware implementations
required
6. The algorithm must be public or licensed on
nondiscriminatory terms.
Cipher Block Chaining Mode

(a) Encryption. (b) Decryption.


Cipher Feedback Mode

(a) Encryption. (c) Decryption.


Counter Mode

 Encryption using counter mode.


Public-Key Cryptography
Principles
 The use of two keys has consequences in:
key distribution, confidentiality and
authentication.
 The scheme has six ingredients (see Figure 3.7)
 Plaintext
 Encryption algorithm
 Public and private key
 Ciphertext
 Decryption algorithm
Encryption using Public-Key
system
Applications for Public-Key
Cryptosystems
 Three categories:
 Encryption/decryption: The sender
encrypts a message with the recipient’s
public key.
 Digital signature: The sender ”signs” a
message with its private key.
 Key exchange: Two sides cooperate two
exchange a session key.
Requirements for Public-Key
Cryptography
1. Computationally easy for a party B to
generate a pair (public key KUb,
private key KRb)
2. Easy for sender to generate
ciphertext:
3. Easy for the receiver to decrypt
ciphertect using private key:
C  E KUb (M )
M  DKRb (C )  DKRb [ EKUb ( M )]
Requirements for Public-Key
Cryptography
1. Computationally infeasible to determine
private key (KRb) knowing public key (KUb)
2. Computationally infeasible to recover
message M, knowing KUb and ciphertext C
3. Either of the two keys can be used for
encryption, with the other used for
decryption:

M  DKRb [ EKUb ( M )]  DKUb [ EKRb ( M )]


Public-Key Cryptographic
Algorithms
RSA and Diffie-Hellman
RSA - Ron Rives, Adi Shamir and Len
Adleman at MIT, in 1977.
 RSA is a block cipher
 The most widely implemented
Diffie-Hellman
 Echange a secret key securely
RSA Key Setup
 each user generates a public/private key pair
by:
 selecting two large primes at random - p, q
 computing their system modulus n=p.q
 note ø(n)=(p-1)(q-1)
 selecting at random the encryption key e
 where 1<e<ø(n), gcd(e,ø(n))=1
 solve following equation to find decryption key
d
 e.d=1 mod ø(n) and 0≤d≤n
 publish their public encryption key: PU={e,n}
 keep secret private decryption key: PR={d,n}
Example of RSA Algorithm
The RSA Algorithm - Encryption

Plaintext: M<n

Ciphertext: C = Me (mod n)
The RSA Algorithm - Decryption

Ciphertext: C

Plaintext: M = Cd (mod n)

You might also like