Cryptography 101 How is data actually secured. RSA Public Key Encryption RSA – names after the inventors –Rivest, Shamir, and Adleman Basic Idea: Your.

Slides:

Advertisements

Similar presentations

(ENCODING AND DECODING TECHNIQUES)

Advertisements

IS 302: Information Security and Trust Week 4: Asymmetric Encryption

Digital Signatures. Anononymity and the Internet.

Asymmetric-Key Cryptography

Section 3.8: More Modular Arithmetic and Public-Key Cryptography

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

Public Key Encryption Algorithm

PUBLIC KEY CRYPTOGRAPHY A brief overview By Andy Brodie.

Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.

CC3.12 Erdal KOSE Privacy & Digital Security Encryption.

RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem

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

RSA Exponentiation cipher

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

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

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.

CSCI 172/283 Fall 2010 Public Key Cryptography. New paradigm introduced by Diffie and Hellman The mailbox analogy: Bob has a locked mailbox Alice can.

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

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

Chapter 12 Cryptography (slides edited by Erin Chambers)

Rachana Y. Patil 1 1.

Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.

1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)

Encryption Encryption encodes information to hide it from everyone else … maintaining your privacy.

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.

_______________________________________________________________________________________________________________ E-Commerce: Fundamentals and Applications1.

CS110: Computers and the Internet Encryption and Certificates.

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.

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

RSA By: Abhishek Naik Viswanath Chennuru CPSC 624.

Public-Key Cryptography CS110 Fall Conventional Encryption.

Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:

Network Encryption Vince Ceccarelli Group 7 TC 200.

Improving Encryption Algorithms Betty Huang Computer Systems Lab

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Introduction to cryptography by konrad. Introduction to cryptography Cryptography is the process of encrypting/decrypting data streams using some E(M)/D(M)

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

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.

Public Key (RSA) Day 27. Objective Students will be able to… …understand how RSA is used for encryption and decryption. …understand some of the challenges.

CSC 386 – Computer Security Scott Heggen. Agenda Exploring that locked box thing from Friday?

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

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

CRYPTOGRAPHY. WHAT IS PUBLIC-KEY ENCRYPTION? Encryption is the key to information security The main idea- by using only public information, a sender can.

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

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

Encryption CS110: Computer Science and the Internet.

Encryption on the Internet Jeff Cohen. Keeping Information Secret What information do we want to be secret? –Credit card number –Social security number.

CSI-09 COMMUNICATION TECHNOLOGY SECURITY MECHANISMS IN A NETWORK AUTHOR - V. V. SUBRAHMANYAM.

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.

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

Cryptography Deffie hellman. organization Foundations Symmetric key Symmetric key weaknesses Assymmetric key Deffie hellman – key exchange RSA – public.

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.

Digital Signatures.

Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.

Encryption. Encryption Basics • Plaintext - the original message ABCDEFG • Ciphertext - the coded message DFDFSDFSD • Cipher - algorithm for.

Public Key Encryption and the RSA Algorithm

PART VII Security.

Rivest, Shamir and Adleman

Analysis of the RSA Encryption Algorithm

MSIT 543 Cryptography Concepts and Techniques How RSA Encryption Works

NET 311 Information Security

Presentation transcript:

Cryptography 101 How is data actually secured

RSA Public Key Encryption RSA – names after the inventors –Rivest, Shamir, and Adleman Basic Idea: Your private key is the only key that can unlock (decrypt) messages that were locked (encrypted) with your public key.

Public & Private Keys Share you public key –Thus, users can send you encrypted data Never share your private key –Thus, no one else can decrypt messages that are sent to you and encrypted with you public key

How does it work? Answer: Math Background: –What are the factors of 30? –What are prime numbers. –What are the prime factors of 30?

Public Key Public Key = PK = p*q Example: –p = 5 –q = 11 –PK = is special; Its the product of two prime numbers.

Example tut/rsa3.htmhttp:// tut/rsa3.htm PK = 55 Here I’m going to encrypt the letter ‘E’ ‘E’ is represent in ASCII as 69 The encryption technique will actually transform the letter ‘E’ (69) into the number ‘1’ (49)

Encryption Take your text (T = 69) Enlarge it by raising it to a power (e = 3) –Here I can pick E to be whatever I want Divide by Public Key (PK = 55) The remainder is the encrypted ciphertext (C =49) 69 3 = 328, ,509 / 55 = 5972 R 49

Decryption How do you decrypt 49 back into a 69? You have to compute a special value –The book calls this value s –Most other books call this value d s = (1/e) * (2 * (p-1) * (q-1) + 1) s = 1/3 * (2*4*10 + 1) s = 1/3 * 81 s = 27

Decryption How do you decrypt 49 (C) back into a 69 (T)? Take your ciphertext (C = 49) Enlarge it by raising it to a power (s = 27) –Here s depends on your choice of p, q, and e. Divide by Public Key (PK = 55) The remainder is the original (C =49) = a really big number really big number / 55 = 5972 R 69

Summary Encryption –uses the Public Key (PK) and specially selected value (e) –These are both Public knowledge –In fact, the Public key is both PK and e Decryption –uses a specially computed value s (some books call it d) –This value is kept private. –It computationally impossible to figure out s unless you know p and q. –The private key is s. But keep in mind that s is computed from p, q, and e.