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

Slides:

Advertisements

Similar presentations

Public Key Encryption Algorithm

Advertisements

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.

Cryptography and Network Security Chapter 9 Fourth Edition by William Stallings.

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.

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

The RSA Algorithm JooSeok Song Tue.

Network Security Essentials Chapter 3

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

Introduction to Public Key Cryptography

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

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.

Prime Numbers Prime numbers only have divisors of 1 and self

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 and its Mathematics Behind

Information Security Principles & Applications

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

1 Public-Key Cryptography and Message AuthenticationPublic-Key Cryptography and Message Authentication Henric Johnson Blekinge Institute of Technology,

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.

Public-Key Encryption

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.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

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

Politiche delle Reti e Sicurezza 2008 UNICAM. M.L.Maggiulli © Maria Laura Maggiulli Dipartimento di Informatica.

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.

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

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

Cryptography & Network Security : Topic Seminar Description & Analysis Madhava.N 1RV06SCN05 2 nd Semester M.Tech CNE RVCE RSA ALGORITHM.

Cryptography and Network Security Public Key Cryptography and RSA.

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

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

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

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

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.

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

Cryptography and Network Security Chapter 9 Fourth Edition by William Stallings.

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

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

RSA Pubic Key Encryption 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.

CIM PKI011 Public-key Encryption and Hash Functions Cryptography and Network Security Third Edition by William Stallings Modified from lecture slides.

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 and Network Security Chapter 9 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

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

Lecture 5 RSA DR. Nermin Hamza.

The RSA Algorithm JooSeok Song Tue.

Private-Key Cryptography

ICS 353: Design and Analysis of Algorithms

The RSA Algorithm JooSeok Song Tue.

“Public Key Cryptography” & “RSA”

Chapter -5 PUBLIC-KEY CRYPTOGRAPHY AND RSA

The RSA Public-Key Encryption Algorithm

Presentation transcript:

“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 integers between 0 and n-1,size of n is typically1024 bits  based on exponentiation and modulation a prime exponentiation takes O((log n) 3 ) operations (easy) exponentiation takes O((log n) 3 ) operations (easy)  security due to cost of factoring large numbers factorization takes O(e log n log log n ) operations (hard) factorization takes O(e log n log log n ) operations (hard)

RSA Key Setup  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) note ø(n)=(p-1)(q-1)  Selecting at random the encryption key e where 1<e<ø(n), gcd(e,ø(n))=1where 1<e<ø(n), gcd(e,ø(n))=1  Solve following equation to find decryption key d e.d mod ø(n) =1 and 0≤d≤n e.d mod ø(n) =1 and 0≤d≤n  Publish their public encryption key: PU={e,n}  Keep secret private decryption key: PR={d,n}

RSA En/decryption  to encrypt a message M the sender: obtains public key of recipient PU={e,n} obtains public key of recipient PU={e,n} computes: C = M e mod n, where 0≤M<n computes: C = M e mod n, where 0≤M<n  to decrypt the ciphertext C the owner: uses their private key PR={d,n} uses their private key PR={d,n} computes: M = C d mod n computes: M = C d mod n  note that the message M must be smaller than the modulus n (block if needed)

Why RSA Works  It is infeasible to determine d given e and n  because of Euler's Theorem: a ø(n) mod n =1 where gcd(a,n)=1 a ø(n) mod n =1 where gcd(a,n)=1  in RSA have: n=p.q n=p.q ø(n)=(p-1)(q-1) ø(n)=(p-1)(q-1) carefully choose e & d to be inverses mod ø(n)  ed mod φ(n) = 1 carefully choose e & d to be inverses mod ø(n)  ed mod φ(n) = 1

RSA Example - Key Setup 1. Select primes: p=17 & q=11 2. Calculate n = pq =17 x 11= Calculate ø(n)=(p–1)(q-1)=16x10= Select e between 1 and 160 : gcd(e,160)=1; choose e=7 5. Determine d : de mod 160 =1 and d < 160 Value is d=23 since 23x7= Publish public key PU={7,187} 7. Keep secret private key PR={23,187}

RSA Example - En/Decryption  sample RSA encryption/decryption is:  given message M = 88 (nb. 88<187 )  encryption: C = 88 7 mod 187 = 11  decryption: M = mod 187 = 88

RSA ENCRYPTION… AN EXAMPLE C = M e mod nM = C d mod n Public key: (5,119)Private key: (77,119) 19 5 = = with remainder 119 of 66 Plain Text = = remainder of Plain Text 19 Cipher text

RSA Exercise  Perform encryption and decryption using RSA algorithm 1) p=5,q=11, e=3 & M=9 1) p=5,q=11, e=3 & M=9 2) p=11,q=13,e=11,M=7 2) p=11,q=13,e=11,M=7