Mid-term Review Network Security. Secure channel SSL (and many others:incl. IPSEC) Shared key establishing Trusted party (Kerberos, etc. - to be covered)

Slides:

Advertisements

Similar presentations

Number Theory Algorithms and Cryptography Algorithms Prepared by John Reif, Ph.D. Analysis of Algorithms.

Advertisements

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.

22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.

Notation Intro. Number Theory Online Cryptography Course Dan Boneh

7. Asymmetric encryption-

Gene Itkis: BU CAS Network Security

Mid-term Review Network Security. Gene Itkis: CS558 Network Security2 Secure channel SSL SSL (and many others: incl. IPSEC) Shared key establishing Trusted.

Mid-term Review Network Security. Secure channel SSL SSL (and many others: incl. IPSEC) Shared key establishing Trusted party (Kerberos, etc. - to be.

Elliptic Curve Cryptography (ECC) Mustafa Demirhan Bhaskar Anepu Ajit Kunjal.

RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem

Network Security Review. Secure channel Communication security Confidentiality Message Traffic Authentication Integrity How to achieve? Establish shared.

Introduction to Modern Cryptography Lecture 5 Number Theory: 1. Quadratic residues. 2. The discrete log problem. Intro to Public Key Cryptography Diffie.

How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.

CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.

Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.

CSE 321 Discrete Structures Winter 2008 Lecture 8 Number Theory: Modular Arithmetic.

Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.

Dr.Saleem Al_Zoubi1 Cryptography and Network Security Third Edition by William Stallings Public Key Cryptography and RSA.

Public Key Algorithms 4/17/2017 M. Chatterjee.

Slide 1 Vitaly Shmatikov CS 378 Overview of Public-Key Cryptography.

Introduction to Computer and Network Security Iliano Cervesato 2 September 2008 – Public-key Encryption.

Lecture 6: Public Key Cryptography

CN8816: Network Security1 Confidentiality, Integrity & Authentication Confidentiality - Symmetric Key Encryption Data Integrity – MD-5, SHA and HMAC Public/Private.

Introduction to Public Key Cryptography

Public Key Model 8. Cryptography part 2.

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

Introduction to Modular Arithmetic and Public Key Cryptography.

Network and Communications Network Security Department of Computer Science Virginia Commonwealth University.

1 Network Security Lecture 6 Public Key Algorithms Waleed Ejaz

RSA and its Mathematics Behind

RSA Ramki Thurimella.

Prelude to Public-Key Cryptography Rocky K. C. Chang, February

Applied Cryptography Spring 2015 Asymmetric ciphers.

Introduction to Modern Cryptography Lecture 5 Number Theory: 1. Quadratic residues. 2. The discrete log problem. Intro to Public Key Cryptography Diffie.

Midterm Review Cryptography & Network Security

BASIC CRYPTOGRAPHIC CONCEPTS. Public Key Cryptography  Uses two keys for every simplex logical communication link.  Public key  Private key  The use.

Introduction to Algorithms Second Edition by Cormen, Leiserson, Rivest & Stein Chapter 31.

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

PUBLIC KEY CRYPTOSYSTEMS Symmetric Cryptosystems 23/10/2015 | pag. 2.

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

Cryptography and Network Security Chapter 13 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

CS461/ECE422 Spring 2012 Nikita Borisov — UIUC1.  Text Chapters 2 and 21  Handbook of Applied Cryptography, Chapter 8 

The RSA Algorithm. Content Review of Encryption RSA An RSA example.

Symmetric Cryptography, Asymmetric Cryptography, and Digital Signatures.

PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.

A Quick Tour of Cryptographic Primitives Anupam Datta CMU Fall A: Foundations of Security and Privacy.

RSA and its Mathematics Behind July Topics  Modular Arithmetic  Greatest Common Divisor  Euler’s Identity  RSA algorithm  Security in RSA.

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

CSE 311: Foundations of Computing Fall 2014 Lecture 12: Primes, GCD.

Scott CH Huang COM 5336 Cryptography Lecture 6 Public Key Cryptography & RSA Scott CH Huang COM 5336 Cryptography Lecture 6.

A A E E D D C C B B # Symmetric Keys = n*(n-1)/2 F F

Chapter 9 Public Key Cryptography and RSA. Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender.

Lecture 6.1: Misc. Topics: Number Theory CS 250, Discrete Structures, Fall 2011 Nitesh Saxena.

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

ECE454/599 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2012.

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

Lecture 6. RSA Use in Encryption to encrypt a message M the sender: – obtains public key of recipient PU={e,n} – computes: C = M e mod n, where 0≤M

CSEN 1001 Computer and Network Security Amr El Mougy Mouaz ElAbsawi.

Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim

Key Exchange in Systems VPN usually has two phases –Handshake protocol: key exchange between parties sets symmetric keys –Traffic protocol: communication.

Lecture 5 Asymmetric Cryptography. Private-Key Cryptography Traditional private/secret/single key cryptography uses one key Shared by both sender and.

Public Key Encryption Major topics The RSA scheme was devised in 1978

Asymmetric-Key Cryptography

RSA Slides by Kent Seamons and Tim van der Horst

Public Key Encryption and Digital Signatures

LAB 3: Digital Signature

Presentation transcript:

Mid-term Review Network Security

Secure channel SSL (and many others:incl. IPSEC) Shared key establishing Trusted party (Kerberos, etc. - to be covered) Public key methods

Public Key techniques Diffie-Hellman RSA N=pq; ed  1 (mod  (N)) Public:e,N;Private:d,N Encrypt M: C  M e modN Decrypt C: M  C d modN Sign M: S  M d mod N Verify S: S e  M (modN) AliceBob ab p, g m a  g a mod pm b  g b mod p mama mbmb m b a mod pm a b mod p=g ab mod p= shared secret key! Discrete log: Given y,p,b Find x: b x mod p = y ? Factoring: Given N=pq Find p,q

Discrete log based schemes DH, DSS (El-Gamal); Elliptic Curves Cryptography (ECC) Why modulus (p) is so large? Have not seen attacks on it (yet!)

Factoring based RSA Square Roots (=factoring) Rabin (Encryption,Signature) Fiat-Shamir (ID scheme, Signature)

World mod N How many objects? |Z * N |=  (N); for all z  Z * N, z  (N) mod N=1 If N=pq, then  (N)= (p-1)(q-1) [ If N=p, then  (N)= p-1 ] Blum integers: N=pq, p  q  3 (mod 4) Then x (p+1)/4 mod p= y; y 2  x (p+1)/2  x (p-1)/2 x  ±x mod p

Chinese Remainder Theorem (CRT) Given y 2 =x mod p; z 2 =x mod q; N=pq; Find s: s 2 =x mod N More generally: Given a,A, b,B; Find x: x=a mod A, x=b mod B Let u, v be s.t. uA=1 mod B, vB=1 modA Then x=uAb+vBa [indeed: x mod A = uAb+vBa = vBa = a; x mod B = uAb+vBa = uAb = b] How to find u,v?

Extended GCD Euclid’s GCD algorithm (greatest common divisor): gcd(a,b) = gcd( b, a mod b) =…= gcd(a’,b’)=c a’=ib’+c, …, ax+by=c If gcd(a,b)=1: ax=1 mod b

Summary RSA Given p,q; Can compute  (N), for N=pq; With Extended gcd, can compute e, d = 1/e mod  (N); [ gcd(e,  (N)) must be 1 ] Rabin Using Blum integers can compute SQRT mod p,q Using CRT can combine them to SQRT mod N

Efficiency for all Exponentiation: Repetitive Squaring b A mod N takes  1.5 lg A long multiplications Cost of multiplication  quadratic in length Optimization: mod N  mod p + mod q +CRT Watch out!

Attacks on factoring  (N), N => factoring (quadratic equation) Trick: obtain x, s.t. x=0 mod p, x  0 mod q gcd(x, N)=p SQRT modN => Factoring v  y 2 mod N; z  SQRT modN (v) If z  ±y, then x  y-z Computing mod p + mod q + CRT Random error mod p (or mod q) => factoring

Later in the course Crypto Hashing MD5, SHA MAC Symmetric ciphers DES, AES/Rijndael, RC-4 Modes of operation (for block ciphers) Systems IPSec - security on another level Kerberos - key distribution (symmetric crypto) Firewalls, IDS, etc.