RSA Public Key Algorithm. RSA Algorithm history  Invented in 1977 at MIT  Named for Ron Rivest, Adi Shamir, and Len Adleman  Based on 2 keys, 1 public.

Slides:

Advertisements

Similar presentations

CS555Spring 2012/Topic 171 Cryptography CS 555 Topic 17: Textbook RSA encryption.

Advertisements

RSA COSC 201 ST. MARY’S COLLEGE OF MARYLAND FALL 2012 RSA.

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

Asymmetric-Key Cryptography

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

Public Key Cryptosystems - RSA Receiver Sender Eavesdroppe r p q p q p q p and q prime.

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

Public Key Encryption Algorithm

Primality Testing By Ho, Ching Hei Cheung, Wai Kwok.

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

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 Lecture 11: Oct 12. Cryptography AliceBob Cryptography is the study of methods for sending and receiving secret messages. adversary Goal:

Public Key Cryptography

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.

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

Public Key Cryptography Bryan Pearsaul. Outline What is Cryptology? Symmetric Ciphers Asymmetric Ciphers Diffie-Hellman RSA (Rivest/Shamir/Adleman) Moral.

“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  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.

1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

1 Network Security Lecture 6 Public Key Algorithms Waleed Ejaz

RSA and its Mathematics Behind

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.

RSA Ramki Thurimella.

T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.

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.

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.

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

Public-Key Cryptography CS110 Fall Conventional Encryption.

BASIC CRYPTOGRAPHIC CONCEPTS. Public Key Cryptography  Uses two keys for every simplex logical communication link.  Public key  Private key  The use.

Improving Encryption Algorithms Betty Huang Computer Systems Lab

Introduction to Algorithms Second Edition by Cormen, Leiserson, Rivest & Stein Chapter 31.

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

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

Darci Miyashiro Math 480 April 29, 2013

Public-Key Encryption

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

RSA Public Key Crypto System. About RSA Announced in 1977 by Ronald Rivest, Adi Shamir, and Leonard Adleman Relies on the relative ease of finding large.

1 Public-Key Cryptography and Message Authentication.

What is RSA RSA is a system employed to create the encrypted message in which the key used for encryption is different from that used to decrypt. It is.

RSA Prepared by: SITI ZAINAH ADNAN

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

Presented by Katherine Heller COSC 4765 University of Wyoming April 26, 2011 Image source: PC Dynamics, Inc.

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

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

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

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

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

RSA The algorithm was publicly described in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman at MIT Partly used for PGP (Pretty Good Privacy) to encrypt.

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

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

CS Modular Division and RSA1 RSA Public Key Encryption To do RSA we need fast Modular Exponentiation and Primality generation which we have shown.

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

Primality Testing. Introduction The primality test provides the probability of whether or not a large number is prime. Several theorems including Fermat’s.

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

ECE Prof. John A. Copeland fax Office: GCATT Bldg.

RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

Information and Computer Security CPIS 312 Lab 8 1 Asymmetric Key Algorithms RSA Algorithm TRIGUI Mohamed Salim.

Cryptography RSA Algorithm BY : Wesam Fadheel Computer science department - WMU CS-6800 Advanced Theory of Computation Instructor: Dr. Elise De Doncker.

RSA Algorithm Date: 96/10/17 Wun-Long Yang. Outline Introduction to RSA algorithm RSA efficient implementation & profiling.

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

Public Key Encryption.

1. Public Key Encryption (A Simple Case)

Analysis of the RSA Encryption Algorithm

The RSA Public-Key Encryption Algorithm

Presentation transcript:

RSA Public Key Algorithm

RSA Algorithm history  Invented in 1977 at MIT  Named for Ron Rivest, Adi Shamir, and Len Adleman  Based on 2 keys, 1 public and 1 private

Basic Algorithm  A private and a public key are generated by a user.  The public key is given to a sender, who encrypts the message using that key.  The user then decrypts the message using the private key

Key generation  2 large prime numbers P and Q are randomly chosen  N = P * Q  S = (P-1) (Q-1)  Value E is chosen where 1<E<N and the greatest common denominator of E and S is 1  A value D is calculated where (D*E) modS = 1  D is the private key  (N,E) is published as the public key

Encryption  To send a message a person uses the public key  The plaintext message is broken into binary segments no larger than N  Each segment is encrypted with the algorithm ciphertext = plaintext E mod N

Decryption  To decrypt the message, the recipient will calculate each segment with plaintext = ciphertext D mod N

Confused?

Alfred chooses 2 primes  P = 19 and Q = 31  N = P*Q = 589

Alfred finds e  (P-1)(Q-1) = 540  E needs to have no GCD with 540  Can be found with Euclid’s algorithm (Example 27.6, p614 Automata)  E = 49

Alfred finds D  D is computed using an extension of Euclid’s algorithm  D = 1069  1069 is the private key  (589,49) is the public key

Batman wants to send message  The message will be “A”  ASCII code for A is 65  The encryption algorithm is then: mod 589  However, don’t actually need to compute 65 49

Batman exploits 2 facts  N i+j = N i * N j  (N*M) mod K = (N mod K)(M mod K) mod K  This is called modular exponentiation  Note that =

Batman encrypts message and sends  mod 589 = mod 589  (65 1 *65 16 *65 32 ) mod 589  (65 1 mod 589)(65 16 mod 589)(65 32 mod 589) mod 589  (65 * 524 * 102) mod 589  mod 589  = 198  Batman sends Alfred the message 198

Alfred decrypts message  Alfred uses the private key 1069 and computes mod 589  This is done with the same process used in encryption to retrieve the message “A”

Why it’s effective  Larger integers increase effectiveness  Encryption and decryption are inverses of each other  User A can find E and D efficiently  Modular exponentiation allows both users to compute encryption and decryption efficiently

Why it’s effective  Any eavesdropper will not be able to recreate the enciphered text because the modular exponentiation is not an invertible function  Also, the private key D cannot be calculated from the public keys N and E

References  Automata, Computability, and Complexity. Elaine Rich. Pearson Prentice Hall,  RSA Laboratories' Frequently Asked Questions About Today's Cryptography, Version 4.1. RSA Laboratories Inc, =2152# =2152#