Lecture Network security: Chapter 18 - Dr. Munam Ali Shah.pptx (Network security)

Network Security Lecture 18 Presented by: Dr. Munam Ali Shah Summary of the Previous Lecture  We have discussed public/ asymmetric key cryptography in detail  We have explored how confidentiality, authentication and integrity could be achieved through public key cryptography Different names  Public key cryptography  Asymmetric key cryptography  2 key cryptography Presented by Diffie & Hallman (1976) New directions in cryptography Essential steps  Each user  generates its pair of keys  Places public key in public folder  Bob encrypt the message using Alice’s public key for secure communication  Alice decrypts it using her private key Outlines of today’s lecture 1. RSA Algorithm 2. Introduction to Pseudorandom Numbers 3. Some Pseudorandom Number Generators 4. Attacks on Pseudorandom generators 5. Tests for pseudorandom functions 6. True Random generators Objectives  You would be able to understand the a public key cryptography algorithm.  You would be able to present an understanding of the random numbers and pseudorandom numbers .  You would be able understand the use and implementation of PRNG. The RSA Algorithm  by Rivest, Shamir & Adleman of MIT in 1977  best known & widely used public-key scheme  Block cipher scheme: plaintext and ciphertext are integer between 0 to n-1 for some n  Use large integers e.g. n = 1024 bits RSA Key Setup  each user generates a public/private key pair by:  selecting two large primes at random - p, q  Computing n=p.q  ø(n)=(p-1)(q-1)   selecting at random the encryption key e  where 1

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Lecture Network security: Chapter 18 - Dr. Munam Ali Shah

Nội dung