8.4 Public Key Cryptography (1970) The Key made public because an unrealistic computer time is required to find a decrypting transformation D from the.

Slides:

Advertisements

Similar presentations

Data Security 1 El_Gamal Cryptography. Data Security2 Introduction El_Gamal is a public-key cryptosystem technique El_Gamal is a public-key cryptosystem.

Advertisements

Asymmetric-Key Cryptography

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

Public Key Encryption Algorithm

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

Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.

OOP/Java1 Public Key Crytography From: Introduction to Algorithms Cormen, Leiserson and Rivest.

Security Chapters 14,15. The Security Environment Threats Security goals and threats.

Security Chapters 14,15. The Security Environment Threats Security goals and threats.

Public Key Crytography1 From: Introduction to Algorithms Cormen, Leiserson and Rivest.

Security Chapter The security environment 9.2 Basics of cryptography 9.3 User authentication 9.4 Attacks from inside the system 9.5 Attacks from.

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.

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

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

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

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.

Computer Science Lecture 22, page 1 Security in Distributed Systems Introduction Cryptography Authentication Key exchange Readings: Tannenbaum, chapter.

Codes, Ciphers, and Cryptography-RSA Encryption

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.

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.

1 Fluency with Information Technology Lawrence Snyder Chapter 17 Privacy & Digital Security Encryption.

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

_______________________________________________________________________________________________________________ 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.

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

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

Public-Key Cryptography CS110 Fall Conventional Encryption.

Midterm Review Cryptography & Network Security

By Yernar.  Background  Key generation  Encryption  Decryption  Preset Bits  Example.

Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.

A Method for Obtaining Digital Signatures and Public-key Cryptosystems

Section 4.4: The RSA Cryptosystem Practice HW Handwritten and Maple Exercises p at end of class notes.

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

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

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

Encryption. What is Encryption? Encryption is the process of converting plain text into cipher text, with the goal of making the text unreadable.

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

30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

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

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

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.

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

Cryptography Readings Encryption, Decryption, & Digital Certificates.

Public Key Cryptosystem Introduced in 1976 by Diffie and Hellman [2] In PKC different keys are used for encryption and decryption 1978: First Two Implementations.

Electronic Commerce School of Library and Information Science PGP and cryptography I. What is encryption? Cryptographic systems II. What is PGP? How does.

Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.

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

Discrete Mathematical Structures: Theory and Applications 1 Cryptography (advanced extra curricular topic)  Cryptography (from the Greek words Kryptos,

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

RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.

Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.

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

Intro to Cryptography ICS 6D Sandy Irani. Cryptography Intro Alice wants to send a message to Bob so that even if Eve can see the transmitted information,

Public Key Cryptography

Chapters 14,15 Security.

Fundamental Concepts in Security and its Application Cloud Computing

Chap 6: Security and Protection

The RSA public-key cryptosystem cse712 e-commerce

Chapters 14,15 Security.

Fluency with Information Technology Lawrence Snyder

Presentation transcript:

8.4 Public Key Cryptography (1970) The Key made public because an unrealistic computer time is required to find a decrypting transformation D from the encryption transformation E

Procedure K= public key E(K)= Encryption function; retained private by the sender and obtained from according to specific rules Sender: plaintext= P E(K) C= Ciphertext D(K)= Decryption function that cannot be found from K in a realistic time by anyone other than the receiver. Receiver: C D(K) P Most popular: RSA (chapter 8), others in chapter 10

In practice Not extensively used for general purpose encryption because E(K) and D(K) require too much time and memory on computers Solution: combine symmetric/secret key with public key systems - Use secret key as based for the cryptosystem with a key K - Use Public Key to send the key K (securely transmitted) Examples: Digital Signature (8.6), Electronic Commerce, passwords, etc.

RSA n= modulo; with p & q LARGE primes: n= p q ф ( n )= (p-1)(q-1) = cardinal{ k≤n: (k,n)=1} Public Key = (e,n) with (e, ф ( n ) ) = 1 Encryption: P  C=P e (mod n) Private key (d,n) with e d= 1 (mod ф ( n ) ) Euler’s theorem: d= e ф ( ф ( n ))-1 (mod ф ( n ) ) Decryption: C  P=C d (mod n)

Reminder: Properties of ф ( n ) Euler Theorem (page 235): m positive & (a,m)=1  a ф ( m ) = 1 (mod m) Theorem 7.2 (page 240): p prime ↔ ф ( p ) = p-1 Theorem 7.4 (page 241): p,q primes  ф ( p q ) = ф ( p ) ф ( q ) Theorem 7.5 (page 242): n=p,q primes  ф ( p q ) = ф ( p ) ф ( q )

Simplified Computations Where a i is the 2m digits representing a block of m letters. For the encryption C=P e (mod n) & decryption P=C d (mod n) On derive: MOD(A L, n) On Maple: Mod(A L, n) d= e ф ( ф ( n ))-1 (mod ф ( n ) )  use Mod(e ф(ф(n))-1,ф ( n ))

Example: Encryption P= BEST WISHES, e=3 n=2669  m=2  use blocks of two letters= four digits P  C=P e (mod n)  =1215, =1224, =1471, =23, =116 (mod 2669). 71= 2(26) + 19 = 19 (mod 26) Ciphertext = MPMYOTAXBQ

Example: Decryption C= 1109 n=2881 = 43 * 67  p = 43 & q = 67 ф(2881) = (p-1)(q-1)=42 * 66 = 2772 e=5, d? With e d= 1 (mod ф ( n ) )  d=1109 P =C 1109 (mod 2881) to each 4-digit block For instance =0400 (mod 2881). Similarly we find 1902, 0714, 0214, 1100, 1904, 0200, 1004 P= EA TC HO CO LA TE CA KE.