Overview of Cryptography Oct. 29, 2002 Su San Im CS Dept. EWU.

Slides:

Advertisements

Similar presentations

Spring 2000CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.

Advertisements

Public Key Cryptography & Message Authentication By Tahaei Fall 2012.

Asymmetric-Key Cryptography

CSE331: Introduction to Networks and Security Lecture 19 Fall 2002.

BY : Darshana Chaturvedi.  INTRODUCTION  RSA ALGORITHM  EXAMPLES  RSA IS EFFECTIVE  FERMAT’S LITTLE THEOREM  EUCLID’S ALGORITHM  REFERENCES.

Attacks on Digital Signature Algorithm: RSA

Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.

ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.

Cryptographic Techniques Instructor: Jerry Gao Ph.D. San Jose State University URL: May,

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.

Public Key Cryptography

Public Encryption: RSA

McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.

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

RSA Encryption William Lu. RSA Background  Basic technique first discovered in 1973 by Clifford Cocks of CESG (part of British GCHQ)  Invented in 1977.

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

Katz, Stoica F04 EE 122: (More) Network Security November 5, 2003.

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,

Lecture 24 Cryptography CPE 401 / 601 Computer Network Systems slides are modified from Jim Kurose and Keith Ross and Dave Hollinger.

1 CS 194: Distributed Systems Security Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.

Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.

Asymmetric encryption. Asymmetric encryption, often called "public key" encryption, allows Alice to send Bob an encrypted message without a shared secret.

Public Key Model 8. Cryptography part 2.

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

Rachana Y. Patil 1 1.

CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.

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

1 Cryptography Basics. 2 Cryptography Basic terminologies Symmetric key encryption Asymmetric key encryption Public Key Infrastructure Digital Certificates.

Behzad Akbari Spring In the Name of the Most High.

_______________________________________________________________________________________________________________ E-Commerce: Fundamentals and Applications1.

RSA Implementation. What is Encryption ? Encryption is the transformation of data into a form that is as close to impossible as possible to read without.

Cryptography: RSA & DES Marcia Noel Ken Roe Jaime Buccheri.

10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.

ECE509 Cyber Security : Concept, Theory, and Practice Cryptography Spring 2014.

Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.

Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.

Public-Key Cryptography CS110 Fall Conventional Encryption.

Midterm Review Cryptography & Network Security

Computer and Internet Security. Introduction Both individuals and companies are vulnerable to data theft and hacker attacks that can compromise data,

4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.

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

Darci Miyashiro Math 480 April 29, 2013

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.

Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

Algebra of RSA codes Yinduo Ma Tong Li. Ron Rivest, Adi Shamir and Leonard Adleman.

11-Basic Cryptography Dr. John P. Abraham Professor UTPA.

Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.

Digital Signatures, Message Digest and Authentication Week-9.

1 Network Security Basics. 2 Network Security Foundations: r what is security? r cryptography r authentication r message integrity r key distribution.

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

15-499Page :Algorithms and Applications Cryptography I – Introduction – Terminology – Some primitives – Some protocols.

POON TENG HIN.  RSA  Shamir’s Three-Pass Protocol  Other issues.

Encryption CS110: Computer Science and the Internet.

Mort Anvari Introduction to Encryption Technology To insert your company logo on this slide From the Insert Menu Select “Picture” Locate your logo file.

UNIVERSITY OF BIELSKO- BIALA AKADEMIA TECHNICZNO-HUMANISTYCZNA Faculty of Mechanical Engineering and Computer Science.

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

1 Cryptography Troy Latchman Byungchil Kim. 2 Fundamentals We know that the medium we use to transmit data is insecure, e.g. can be sniffed. We know that.

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

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

 Last Class  Chapter 7 on Data Presentation Formatting and Compression  This Class  Chapter 8.1. and 8.2.

Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.

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

Cryptography By: Nick Belhumeur. Overview What is Cryptography? What is Cryptography? 2 types of cryptosystems 2 types of cryptosystems Example of Encryption.

1. Public Key Encryption (A Simple Case)

Presentation transcript:

Overview of Cryptography Oct. 29, 2002 Su San Im CS Dept. EWU

Contents Cryptography Encryption/Decryption Methods Encryption/Decryption Protocols

Cryptography Description: The art and science of keeping messages secure by altering or transforming them m: Plaintext Encryption c: Ciphertext Decryption Original Plaintext Key

Criteria of Good Cryptography Confidentiality – Can decrypt only with a secret key Authentication – Identify the person at the other end of the line Integrity – No change during transit (message authentication) & detecting the loss of integrity Nonrepudiation – Know who sent the message & Documented proof of identity of sender

Encryption Methods Symmetric Key: Secret Key Encryption (Same key for encryption and decryption) e.g.: DES(Data Encryption Standard), AES(Advanced Encryption Standard) Asymmetric Key: Public Key Encryption (Different keys for encryption and decryption) e.g.: RSA(Rivest Shamir Adleman)

RSA Named after Ronald Rivest, Adi Shamir, Leonard Adleman Public Key: n, e such that 1. n=p · q 2. e is relatively prime to (p-1) · (q-1) 3. p and q are prime numbers which remain secret Private Key: n, d and d is kept secret => 1 = (e · d) mod Encryption: c = Decryption: m =

Example: RSA n=3337 (p=47 and q=71, 47 ·71=3337) Choose e =79 Let m=688 be the message d=1019 (  find x 1=(79 · x) mod (46 · 70=3220) ) c=688 mod 3337 = 1570 => Encrypted message m=1570 mod 3337 = 688 => Decrypted message

Encryption/Decryption Protocols M M, KCK CM, K M H HNo|Yes H S S start a b c d e f g h j k l m n n In this chart, boxes contain information, and paths denote activity working with or changing the information. Initially, Alice has a message M that she wishes to send signed to Bob, via a security protocol. a.Alice generates a random key K for DES encryption. b.Alice hashes M to create H. c.Alice encrypts the key K with Bob’s public key to create CK

Encryption/Decryption Protocols M M, KCK CM, K M H HNo|Yes H S S start a b c d e f g h j k l m n n d. Alice encrypts M using DES with key K to create CM. e. Alice encrypts the hash H with her private key to create signature S. f. Alice sends the encrypted form CK of the key K to Bob. g. Alice sends the encrypted form CM of the message M to Bob. h. Alice sends her “signature”, the encrypted form S of the hash H, to Bob.

Encryption/Decryption Protocol M M, KCK CM, K M H HNo|Yes H S S start a b c d e f g h j k l m n n j. Bob uses his private key to decrypt CK to recover the key K. k. Bob uses K to decrypt CM to recover the message M. l. Bob uses Alice’s public key to decrypt her signature S to recover the hash H. m. Bob hashes M to create his own version of the hash H. n. Bob compares for equality his version of the hash H with the version decrypted from Alice’s signature.

Public Key Encryption/Decryption Protocols Start with a letter s Convert to a number 19 Encrypt(public key of 3) 39 Decrypt(private key of 27) 19 Convert to a letter s

Public Key Encryption/Decryption Protocols Encryption: n = 55, e = 3, p = 5, q = 11 Let m = 19 Decryption: 3d = 1 mod 40  1= (3d) mod 40  d = 27 m = = 584,064 mod 55 = 19

Digital Signature Author authentication Message authentication - Assures recipients that the message was not altered in transit (integrity) Backward of Public Key Encryption & Decryption Processes Use Private Key to encrypt Public Key to decrypt

Mathematical Background Information Theory: How to convey info. through number Complexity Theory: How complex it is Ex) O(n) Number Theory: Find properties, patterns, and relationships of numbers. Ex) Prime Test Probability, Statistics: How to make it secure

Number Theory(Why Prime?) Prime Number: 1 and itself as factors When prime numbers are large enough, they're nearly impossible to factor the prime numbers into p and q.

Number Theory(Theorems) Fermat’s Little Theorem if 0<m < p, p: prime Then Euler’s Theorem if n = p · q p,q : prime and if 0<m<n<p Then (so )

References Bruce Schneier, APPLIED CRYPTOGRAPHY: Protocols, Algorithms, and Source Code in C (2 nd Eds), John Wiley & Sons, (ISBN ) Bruce Schneier, SECRETS AND LIES: Digital Security in a networked world, John Wiley & Sons, (ISBN ) H.M. Mel and Doris Baker, CRYPTOGRAPHY DECRYPTED, Addison-Wesley, (ISBN )

Thank you for your attention.