Cryptography & Network Security Introduction Introduction - - PowerPoint PPT Presentation

cryptography network security introduction introduction
SMART_READER_LITE
LIVE PREVIEW

Cryptography & Network Security Introduction Introduction - - PowerPoint PPT Presentation

Cryptography & Network Security Introduction Introduction Chester Rebeiro IIT Madras CR The Connected World CR 2 Information Storage CR 3 Increased Security Breaches 81% more in 2015 CR


slide-1
SLIDE 1

Cryptography & Network Security Introduction

CR

Introduction

Chester Rebeiro IIT Madras

slide-2
SLIDE 2

The Connected World

CR

2

slide-3
SLIDE 3

Information Storage

CR

3

slide-4
SLIDE 4

Increased Security Breaches

CR

81% more in 2015 http://www.pwc.co.uk/assets/pdf/2015-isbs-executive-summary-02.pdf

4

slide-5
SLIDE 5

Security Threats (why difficult to prevent?)

Networks / Communication links Hardware System Software

CR

Attackers need to target the weakest link in the chain

Peripherals System Software (Operating Systems / Hypervisor) Applications

5

slide-6
SLIDE 6

Security Studies (Research) (an ocean)

Networks / Communication links Hardware System Software Network Security Hardware Security System Security

CR

Peripherals System Software (Operating Systems / Hypervisor) Applications System Security OS Security Cloud Security Web Security DBMS Security Embedded Security Cryptography

6

slide-7
SLIDE 7

Cryptography

  • A crucial component in all security systems
  • Fundamental component to achieve

– Confidentiality

CR

Allows only authorized users access to data

7

slide-8
SLIDE 8

Cryptography (its use)

  • A crucial component in all security systems
  • Fundamental component to achieve

– Confidentiality – Data Integrity

CR

– Data Integrity

Cryptography can be used to ensure that only authorized users can make modifications (for instance to a bank account number)

8

slide-9
SLIDE 9

Cryptography (its use)

  • A crucial component in all security systems
  • Fundamental component to achieve

– Confidentiality – Data Integrity

CR

– Data Integrity – Authentication

Cryptography helps prove identities

9

slide-10
SLIDE 10

Cryptography (its use)

  • A crucial component in all security systems
  • Fundamental component to achieve

– Confidentiality – Data Integrity

I did not send that

CR

– Data Integrity – Authentication – Non-repudiation

The sender of a message cannot claim that she did not send it

send that

10

slide-11
SLIDE 11

Scheme for Confidentiality

Alice Bob message Attack at Dawn!! untrusted communication link

CR

Attack at Dawn!! Mallory Problem : Alice wants to send a message to Bob (and only to Bob) through an untrusted communication link

11

slide-12
SLIDE 12

Encryption

Alice Bob message untrusted communication link E D KE KD “Attack at Dawn!!” encryption decryption #%AR3Xf34^$ (ciphertext)

CR

message “Attack at Dawn!!” Mallory

Secrets

  • Only Alice knows the encryption key KE
  • Only Bob knows the decryption key KD

Only sees ciphertext. cannot get the plaintext message because she does not know the keys

12

slide-13
SLIDE 13

Encryption Algorithms

Alice Bob untrusted communication link E D KE KD “Attack at Dawn!!” encryption decryption #%AR3Xf34($ (ciphertext)

CR

  • Should be easy to compute for Alice / Bob (who know the key)
  • Should be difficult to compute for Mallory (who does not know the key)
  • What is ‘difficult’?
  • Ideal case : Prove that the probability of Mallory determining the encryption /

decryption key is no better than a random guess

  • Computationally : Show that it is difficult for Mallory to determine the keys

even if she has massive computational power

13

slide-14
SLIDE 14

Algorithmic Attacks

  • Can Mallory use tricks to break the algorithm

CR

  • There by reducing the ‘difficulty’ of getting the

key.

14

E

slide-15
SLIDE 15

Encryption Keys

Alice Bob untrusted communication link E D KE KD “Attack at Dawn!!” encryption decryption #%AR3Xf34($ (ciphertext)

CR

  • How are keys managed

– How does Alice & Bob select the keys? – Need algorithms for key exchange

15

slide-16
SLIDE 16

Ciphers

  • Symmetric Algorithms

– Encryption and Decryption use the same key – i.e. KE = KD – Examples:

  • Block Ciphers : DES, AES, PRESENT, etc.
  • Stream Ciphers : A5, Grain, etc.

CR

  • Stream Ciphers : A5, Grain, etc.
  • Asymmetric Algorithms

– Encryption and Decryption keys are different – KE ≠ KD – Examples:

  • RSA
  • ECC

16

slide-17
SLIDE 17

Cipher Implementations

Cryptography is always an overhead !!

  • For security, the algorithms need to be computation

intensive.

CR

intensive.

  • Often require large numbers, complex mathematical
  • perations.
  • Design Challenges: Performance, Size, Power.
  • Algorithms to achieve this

17

slide-18
SLIDE 18

Encryption Devices

Alice Bob message untrusted communication link E D KE KD “Attack at Dawn!!” encryption decryption #%AR3Xf34($ (ciphertext)

CR

message “Attack at Dawn!!” Mallory

Side Channels

  • Eg. Power consumption / radiation
  • f device, execution time, etc.

Gets information about the keys by monitoring Side channels of the device

18

slide-19
SLIDE 19

Side Channel Analysis

Alice message E 00111 encryption

CR

19

Radiation from Device 1 1 1 Secret information 1

message “Attack at Dawn!!”

slide-20
SLIDE 20

Ciphers Design Challenges

We want crypto algorithms to be fast and small Tradeoffs between Security , Speed, Side-Channel Attacks

CR

For security, the algorithms are computationally intensive. Typically use large numbers, complex operations

Need to protect against side channel attacks.

slide-21
SLIDE 21

Cryptography Study

  • Mathematics + Engineering

Mathematics Electrical Engg.

CR

Computer Sc. cryptography

21

Physics

slide-22
SLIDE 22

Some Hot Research Trends

light weight cryptography post-quantum cryptography efficient implementations cryptanalysis privacy enhancing security

CR

22

light weight cryptography post-quantum cryptography Leakage resilient cryptography side channel analysis cloud security homomorphic encryption

slide-23
SLIDE 23

The Plan Ahead

  • How are ciphers designed?

– Ideal security vs Computational security – Block ciphers / Stream ciphers – Asymmetric key ciphers – Trade offs between security and implementation

CR

– Trade offs between security and implementation

  • Attacks

– Algorithmic / Side Channel Analysis

  • Applications

– How are they used to achieve confidentiality, integrity, authentication, non-repudiation

  • Case Studies

– Network security aspects, Bitcoins

23

slide-24
SLIDE 24

Course Structure

  • Classical Cryptography
  • Shannon’s Theory
  • Block Ciphers

– DES, AES, their implementations and their attacks

  • Stream Ciphers

CR

Stream Ciphers

  • Digital Signatures and Authentication

– Hash functions

  • Public key ciphers

– RSA, implementations, and attacks

  • Side channel analysis
  • Network Security aspects
  • Case Studies : Bitcoins

24

slide-25
SLIDE 25

Expected Learning Outcomes

  • What you would learn by the end of the course

Distinguish between cipher algorithms

  • Where to use what algorithm?

Evaluate ciphers and their implementations for security

CR

25

Evaluate ciphers and their implementations for security

  • Mathematical cryptanalysis of some algorithms
  • Side channel based attacks on cipher implementations

Apply algorithms to solve security problems in networks and real-world systems

slide-26
SLIDE 26

Books / References

Textbooks (STINSON) ''Cryptography: Theory and Practice", Third Edition, by Douglas R. Stinson, CRC Press, Taylor and Francis Group References

CR

26

References (STALLINGS) ''Cryptography and Network Security: Principles and Practices'', Sixth Edition, by William Stallings (HANDBOOK) ''Handbook of Applied Cryptography'', Fifth Printing, by Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, CRC Press (HARDSEC) ''Hardware Security : Design, Threats, and Safeguards", by Debdeep Mukhopadhyay and Rajat Subhra Chakraborty, CRC Press, Taylor and Francis Group

slide-27
SLIDE 27

Grading

  • Quiz 1 : 20%
  • Quiz 2 : 20%
  • End semester : 40%
  • Assignments : 20%

CR

  • Assignments : 20%

– Surprise tests / Tutorials / Programming assignments / minute papers / Google groups / etc.

27

Self Study vs Attending Classes

  • Same tutorials / assignments / quizzes / etc.
  • Grading policy is different
slide-28
SLIDE 28

Course Webpages

  • For slides / syllabus / schedule etc.
  • For discussions / announcements / submissions

http://www.cse.iitm.ac.in/~chester/courses/16e_cns/index.html

CR

  • For discussions / announcements / submissions

CSE Moodle Google Groups (cnsiitm_2016)

28

slide-29
SLIDE 29

Logistics

  • CS26
  • Time:

– Tuesdays : 11:00 - 11:50 AM – Wednesdays : 10:00 - 10:50 AM

CR

– Wednesdays : 10:00 - 10:50 AM – Thursdays : 8:00 - 8:50 AM – Fridays : 2:00 – 2:50 PM

29