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

Slides:

Advertisements

Similar presentations

Advertisements

Asymmetric-Key Cryptography

7. Asymmetric encryption-

Dr. Lo’ai Tawalbeh Summer 2007 Chapter 9 – Public Key Cryptography and RSA Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus INCS.

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

Attacks on Digital Signature Algorithm: RSA

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the orderQuestions? Review.

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

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

1 Lecture #10 Public Key Algorithms HAIT Summer 2005 Shimrit Tzur-David.

Public Key Cryptography

Public Encryption: RSA

Cryptography and Network Security Chapter 9. Chapter 9 – Public Key Cryptography and RSA Every Egyptian received two names, which were known respectively.

Public Key Cryptography and the RSA Algorithm

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

CSCE 790: Computer Network Security Chin-Tser Huang University of South Carolina.

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

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

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.

Cryptography and Network Security Chapter 9 5th Edition by William Stallings Lecture slides by Lawrie Brown.

Diffie-Hellman Key Exchange

The RSA Algorithm JooSeok Song Tue.

“RSA”. RSA  by Rivest, Shamir & Adleman of MIT in 1977  best known & widely used public-key scheme  RSA is a block cipher, plain & cipher text are.

Codes, Ciphers, and Cryptography-RSA Encryption

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.

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

Rachana Y. Patil 1 1.

Cryptography A little number theory Public/private key cryptography –Based on slides of William Stallings and Lawrie Brown.

Public Key Cryptography and the RSA Algorithm Cryptography and Network Security by William Stallings Lecture slides by Lawrie Brown Edited by Dick Steflik.

Applied Cryptography (Public Key) RSA. Public Key Cryptography Every Egyptian received two names, which were known respectively as the true name and the.

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.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the order Teams mostly.

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

Network Security Lecture 17 Presented by: Dr. Munam Ali Shah.

Public-Key Cryptography CS110 Fall Conventional Encryption.

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

Public Key Cryptography and RSA” Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 11/9/2009 INCS 741: Cryptography 11/9/20091Dr. Monther.

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

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.

Computer and Network Security Rabie A. Ramadan Lecture 6.

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

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

Key Exchange Methods Diffie-Hellman and RSA CPE 701 Research Case Study Derek Eiler | April 2012.

PUBLIC KEY CRYPTOGRAPHY ALGORITHM Concept and Example 1IT352 | Network Security |Najwa AlGhamdi.

Cryptography and Network Security Public Key Cryptography and RSA.

Network Security Lecture 18 Presented by: Dr. Munam Ali Shah.

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

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.

Fall 2002CS 395: Computer Security1 Chapter 9: Public Key Cryptography.

Diffie-Hellman Key Exchange Color Mixing Example Rick Stroud 21 September 2015 CSCE 522.

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.

1 Java Program to Implement RSA Algorithm Yu-Li Chen April, 2002.

1 Introduction to Computer Security Topic 2. Basic Cryptography (Part II)

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

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

Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.

By Marwan Al-Namari & Hafezah Ben Othman Author: William Stallings College of Computer Science at Al-Qunfudah Umm Al-Qura University, KSA, Makkah 1.

Chapter 9 – Public Key Cryptography and RSA Every Egyptian received two names, which were known respectively as the true name and the good name, or the.

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.

CS480 Cryptography and Information Security

Presentation transcript:

Asymmetric encryption

Asymmetric encryption, often called "public key" encryption, allows Alice to send Bob an encrypted message without a shared secret key there is a secret key, but only Bob knows what it is, and he does not share it with anyone, including Alice

Asymmetric encryption

Bob creates a pair of keys, one of which he keeps secret and one of which he sends to Alice. Alice composes a confidential message and encrypts it using the key that Bob has sent to her. Alice sends the encrypted data to Bob. Bob uses his secret key to decrypt the data and reads the confidential message.

Asymmetric encryption Asymmetric algorithms include a "key generation" protocol that Bob uses to create his key pair, as shown by Figure Following the protocol results in the creation of a pair of keys that have a mathematical relationshipthe exact detail of the protocol and the relationship between the keys is different for each algorithm.

Asymmetric encryption

Creating Asymmetric Keys using RSA Algorithm each user generates a public/private key pair by: selecting two large primes at random - p, q computing their system modulus N=p.q – note ø(N)=(p-1)(q-1) selecting at random the encryption key e where 1< e<ø(N), gcd(e,ø(N))=1 solve following equation to find decryption key d – e.d=1 mod ø(N) and 0≤d≤N Or d = e -1 (mod ( (n)) publish their public encryption key: KU={e,N} keep secret private decryption key: KR={d,p,q}

Example of RSA Ciphertext C = M e mod n Plaintext M = C d mod n Example: p = 17, q = 11 n = 178 ø(N) = 160 e = 7 D = 23 PU = { 7, 187 } ; PR = { 23, 187 } M= 88; C =88 7 mod 187 = 11 C = mod 187 = 88

Encryption

Decryption

Solve this example Start with p= 61 q=53