Lecture 7: Modules 7.1-7.10 Network Security CSE 628/628A: Sandeep K. Shukla Indian Institute of Technology Kanpur

Lecture 7: Modules 7.1-7.
10
Network Security
CSE 628/628A
Sandeep K. Shukla
Indian Institute of Technology Kanpur
Acknowledgements
Dan Boneh (Stanford University)
John C. Mitchell (Stanford University)
Nicolai Zeldovich (MIT)
Jungmin Park (Virginia Tech)
Patrick Schaumont (Virginia Tech)
C. Edward Chow
Arun Hodigere
Mike Freedman, Princeton University
Scott Midkiff, Virginia Tech
Insup Lee, University of Pennsylvania
Web Resources
Lecture 7: Network Security
Total 6 Modules on basic Cryptography and
network security
Module 7.1: Basic Cryptography
Module 7.2: Public Key Crypto
Module 7.3: RSA Public Key Crypto System
Module 7.4: Digital Signatures and Hash Functions
Module 7.5: Public Key Distribution
Module 7.6: Real World Protocols
Module 7.7: Network Security
Outline
How cryptography works
Secrete key cryptography
Public key cryptography
Digital signature
Message digest
Distribution of public keys
Real-world systems
Network Security
4
Module 7.1
Basic Cryptography
Cryptography: Basic
Terminology
Plaintext (or cleartext)
The message.
Denoted by M or P.
Encryption (encipher)
Encoding of message.
Denoted by E.
Ciphertext
Encrypted message.
Denoted by C.
Decryption (decipher)
decoding of ciphertext
denoted by D.
6
Encryption and Decryption
M C M
E D
The following identity must hold true:

D(C) = M, where C = E(M)
M = D(E(M))
7
Cryptography: Algorithms and Keys
A method of encryption and decryption is called a cipher.

Generally there are two related functions: one for
encryption and other for decryption.
Some cryptographic methods rely on the secrecy of the
algorithms.
Such methods are mostly of historical interest these days.
All modern algorithms use a key to control encryption and
decryption.
Encryption key may be different from decryption key.
8
Key Based Encryption/Decryption
K1 K2
M C M
E D
Symmetric Case: both keys are the same or derivable from each
other
K 1 = K 2.
Asymmetric Case: keys are different and not derivable from each
other
K1 != K2
9
Secrete Key Cryptography
K K
M C M
S E D R
K is the secret key shared by both the sender (S) and

receiver (R).
10
Secrete Key Cryptography
Also called symmetric or single-key algorithms.
The encryption and the decryption key are the same.
Techniques based on a combination of substitution and
permutation.
Stream ciphers: operate on single bit or byte.
Block ciphers: operate on blocks (typically 64/128/256
bits)
Advantage: simple, fast.
Disadvantage: key exchange, key management.
Examples: DES,RC4, IDEA, Blowfish, AES, etc.
11
Private Key Cryptosystem
(Symmetric)
12
Symmetric Key - Issues
Key management, keys required = (p*(p-1))/2 or:
13
Secrete Key Assurances
Confidentiality
is assurance that only owners of a shared secrete key can
decrypt a message that has been encrypted with the shared
secrete key
Authentication
is assurance of the identify of the person at the other end of the
line (use challenge and response protocols)
Integrity
is assurance that a message has not been changed during transit
and is also called message authentication (use message
fingerprint)
Non-repudiation
is assurance that the sender cannot deny a file was sent. This 14
Example: non-repudiation
Scenario 1:
Alice sends a stock buy request to Bob
Bob does not buy and claims that he never received the
request
Scenario 2:
Alice sends a stock buy request to Bob
Bob sends back an acknowledge message
Again, Bob does not buy and claims that he never received it
Alice presents the ack message as proof
Can she prove that the ack message was created by him?
15
DES (Data Encryption Standard)
In 1972, NIST (National Institute of Standards and Technology)
decides to assist the development of a secure cryptographic
method.
In 1974, it settled on DES, which was submitted by IBM and is the
Data Encryption Algorithm developed by Horst Feistel.
NSA shortened the secrete key to 56 bits from 128 bits originally
proposed by IBM.
Initially intended for 10 years. DES reviewed in 1983, 1987, 1993.
In 1997, NIST solicited candidates for a new secrete key

encryption standard, Advanced Encryption Standard (AES).
In Oct 2000, NIST selected Rijndael. (www.nist.gov/AES)
16
Cycling through DES keys
In 1977, a 56-bit key was considered good enough.
Takes 1,000 years to try all keys with 56 1s and 0s at one
million keys per second
In Jan 1997, RSA Data Security Inc. issued DES
challenge
DES cracked in 96 days
In Feb 1998, distributed.net cracked DES in 41 days
In July 1998, the Electroic Frontier Foundation (EFF) and
distributed.net cracked in 56 hours using a $250K machine
In Jan 1999, the team did in less than 24 hours
Double and Triple DES
Double DES only gives 2**57 = 2 x 2**56, instead of 2**112, due
to meet-in-the-middle attack.
Triple DES recommended, but managing three keys more difficult17

Lecture 7: Modules 7.1-7.10 Network Security CSE 628/628A: Sandeep K. Shukla Indian Institute of Technology Kanpur

Uploaded by

Copyright:

Available Formats

Lecture 7: Modules 7.1-7.10 Network Security CSE 628/628A: Sandeep K. Shukla Indian Institute of Technology Kanpur

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture 7: Modules 7.1-7.10 Network Security CSE 628/628A: Sandeep K. Shukla Indian Institute of Technology Kanpur

Uploaded by

Copyright:

Available Formats

Lecture 7: Modules 7.1-7.

The following identity must hold true:

A method of encryption and decryption is called a cipher.

K is the secret key shared by both the sender (S) and

In 1997, NIST solicited candidates for a new secrete key

You might also like