Cryptography Deffie hellman. organization Foundations Symmetric key Symmetric key weaknesses Assymmetric key Deffie hellman – key exchange RSA – public.

Slides:

Advertisements

Similar presentations

Public Key Encryptions CS461/ECE422 Fall Reading Material Text Chapters 2 and 20 Handbook of Applied Cryptography, Chapter 8 –

Advertisements

Public Key Cryptography INFSCI 1075: Network Security – Spring 2013 Amir Masoumzadeh.

Cryptography and Network Security Chapter 9

IS 302: Information Security and Trust Week 4: Asymmetric Encryption

Digital Signatures. Anononymity and the Internet.

Cryptography 101 How is data actually secured. RSA Public Key Encryption RSA – names after the inventors –Rivest, Shamir, and Adleman Basic Idea: Your.

RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem

Cryptography Basic (cont)

BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.

Symmetric Key Distribution Protocol with Hybrid Crypto Systems Tony Nguyen.

Public Key Cryptography

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

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

Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications.

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.

Security 2 Distributed Systems Lecture# 15. Overview Cryptography Symmetric Assymeteric Digital Signature Secure Digest Functions Authentication.

1 Pertemuan 08 Public Key Cryptography Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.

8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.

Public Key Cryptography RSA Diffie Hellman Key Management Based on slides by Dr. Lawrie Brown of the Australian Defence Force Academy, University College,

Introduction to Public Key Cryptography

Public Key Model 8. Cryptography part 2.

Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.

 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.

Chapter 12 Cryptography (slides edited by Erin Chambers)

Rachana Y. Patil 1 1.

ElGamal Public Key Cryptography CS 303 Alg. Number Theory & Cryptography Jeremy Johnson Taher ElGamal, "A Public-Key Cryptosystem and a Signature Scheme.

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

Prime Numbers Prime numbers only have divisors of 1 and self

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)

RSA By: Abhishek Naik Viswanath Chennuru CPSC 624.

Cryptography  Why Cryptography  Symmetric Encryption  Key exchange  Public-Key Cryptography  Key exchange  Certification.

1 Lecture 9 Public Key Cryptography Public Key Algorithms CIS CIS 5357 Network Security.

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Chapter 21 Public-Key Cryptography and Message Authentication.

Internet Security. Four Issues of Internet Security Authenticity: Is the sender of a message who they claim to be? Privacy: Are the contents of a message.

Private-Key Cryptography  traditional private/secret/single key cryptography uses one key  shared by both sender and receiver  if this key is disclosed.

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

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

1 Public-Key Cryptography and Message Authentication.

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 

Symmetric Cryptography, Asymmetric Cryptography, and Digital Signatures.

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

Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

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

Cryptography and Network Security Public Key Cryptography and RSA.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

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

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

PUBLIC-KEY CRYPTOGRAPHY AND RSA – Chapter 9 PUBLIC-KEY CRYPTOGRAPHY AND RSA – Chapter 9 Principles Applications Requirements RSA Algorithm Description.

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

Computer Security Lecture 5 Ch.9 Public-Key Cryptography And RSA Prepared by Dr. Lamiaa Elshenawy.

EE 122: Lecture 24 (Security) Ion Stoica December 4, 2001.

Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.

Lecture 3 (Chapter 9) Public-Key Cryptography and RSA Prepared by Dr. Lamiaa M. Elshenawy 1.

Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

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

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

@Yuan Xue 285: Network Security CS 285 Network Security Digital Signature Yuan Xue Fall 2012.

Asymmetric-Key Cryptography

Public Key Encryption and Digital Signatures

Lecture 6: Digital Signature

Chapter -5 PUBLIC-KEY CRYPTOGRAPHY AND RSA

LAB 3: Digital Signature

Presentation transcript:

Cryptography Deffie hellman

organization Foundations Symmetric key Symmetric key weaknesses Assymmetric key Deffie hellman – key exchange RSA – public key, private key Applications of new idea

Foundation Encryption: S k [P] -> [C] Polynomial if k is given Decryption: S k -1 [C] -> [P] Polynomial if k is given K – key P – plain text C – Cypher text Hacker? Figure out S k Unconditionally secure No matter what Computationally secure Summumb to unlimited computation

Symmetric key encryption

DES/ AES Data encryption standard Advanced encryption standard DES - Data encryption standard - 56 bit key size broken in 22 hrs - insecure protocol AES - Advanced encryption standard bit, 192 bit and 256 bit No successful attack till now

Problem of symmetric key exchange

Problem - motivation 1874, William Stanley Jevons Trapdoor functions in cryptography Function f and its trapdoor t can be generated in polynomial time (f,t) = Gen() – generator function Computation of f is easy (polynomial time) but inverse is very hard unless you have the trapdoor

Deffie Hellmann (1976) Key exchange - Motivation Colors - two basic assumptions Generating new colors (mixing) -Easy to mix two colors to make a third color G+R = Y Separating colors from mixture -Given a third color, its hard to find the exact original colors Y = G+R One way function One way lock Easy in one direction Hard in the other Realizations - colors - Modulus (math func)

Colors - example

Deffie hellman – primitive root modulo n Mod function - % We use a prime modulus - 7 We find a primitive root of prime number 7 Why primitive root: This has a property of coverage ->> 3 is one example (this is known as generator)

Deffie hellman - one way lock Primitive root Prime modulo – 17 Primitive root – 3 (generator) Coverage - If 3 is raised to an integer x, then solution (3^x%17) is equally likely to be any integer between 1,17 One way function Finding modulus is easy 3^29%17 = 12 (easy) Reverse problem is hard 3^x mod 17 = 12; only way to find x is brute(hard) (this is discrete log problem)

Primitive root module n – one way function

Primitive root modulo n

Problem with deffie hellman key exchange Have to maintain many keys Open problem – public and private keys (introduced by deffie hellman) Solutions 1977 RSA 2002 turing award 1985 Elgamal excyption, based on deffie hellman

Fundamental issues in crypto Privacy No shall be able to read messages Authentication/ non repudiation The sender should be verifiable Integrity The message is same (no modification)

RSA (Rivest, Shamir, Adleman) – privacy (y) Turing One way function Prime factors

Authentication – non repudiation (y)

Digital signature algorithm(DSA) - integrity (y)

An overview of techniques

Common attacks – not exhaustive Replay attack Problem of public key distribution Breaking the math – (P=NP) Open problems – may be? Unconditionally secure Timed keys

Thanks