Improving Encryption Algorithms Betty Huang Computer Systems Lab 2009-2010.

Slides:

Advertisements

Similar presentations

Chapter 3 Public Key Cryptography and Message authentication.

Advertisements

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

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.

Asymmetric-Key Cryptography

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

Public Key Encryption Algorithm

RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem

Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:

Henric Johnson1 Chapter3 Public-Key Cryptography and Message Authentication Henric Johnson Blekinge Institute of Technology, Sweden

Public Encryption: RSA

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

How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.

Chapter 3 Encryption Algorithms & Systems (Part C)

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.

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

RSA Encryption Caitlin O’Dwyer. What is an RSA Number? An RSA number n is a number s.t. n=pq Where p and q are distinct, large, prime integers.

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

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.

RSA Numbers by: Brandon Hacay & Conrad Allen. History of RSA Numbers The letters in “RSA” are simply the initials of the people who are credited as having.

RSA Encryption & Cryptography

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

1 Public-Key Cryptography and Message Authentication Ola Flygt Växjö University, Sweden

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

Network and Communications Network Security Department of Computer Science Virginia Commonwealth University.

1 Network Security Lecture 6 Public Key Algorithms Waleed Ejaz

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.

RSA and its Mathematics Behind

RSA Ramki Thurimella.

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.

How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.

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

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

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

Darci Miyashiro Math 480 April 29, 2013

Public-Key Encryption

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.

1 Number Theory and Advanced Cryptography 5. Cryptanalysis of RSA Chih-Hung Wang Sept Part I: Introduction to Number Theory Part II: Advanced Cryptography.

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.

RSA Prepared by: SITI ZAINAH ADNAN

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

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.

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

Improving Encryption Algorithms Betty Huang Computer Systems Lab

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,

Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.

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.

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

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 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.

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

DIGITAL SIGNATURE IMPLEMENTATION

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.

EE 122: Lecture 24 (Security) Ion Stoica December 4, 2001.

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.

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

Public Key Cryptography

Public Key Encryption.

Rivest, Shamir and Adleman

Analysis of the RSA Encryption Algorithm

Introduction to Cryptography

The RSA Public-Key Encryption Algorithm

Presentation transcript:

Improving Encryption Algorithms Betty Huang Computer Systems Lab

Abstract The RSA encryption algorithm is commonly used in public security due to the asymmetric nature of the cipher. The procedure is deceptively simple, though; given two random (large) prime numbers p and q, of which n = pq, and message m, the encrypted text is defined as c = m e (mod n). E is some number that is coprime to the totient(n). The public key (n, e), however, makes it difficult for the user to find the private key (n, d), due to the fact that given only n, it is extremely difficult to find the prime factors p and q. The fastest methods currently have O(sqrt(n)) complexity, but require expensive resources and technology (Kaliski). The aim of this paper is to improve on the factorization process required by the RSA encryption algorithm.

Background Purpose of Encryption Algorithms One-way functions Hash functions: MD5, SHA family Block Cipher: DES, Blowfish

RSA Rivest, Shamir, Adleman Asymmetric Block Cipher Different Keys for Encryption/Decryption

Block Ciphers A block cipher consists of two paired algorithms, one for encryption, E, and the other for decryption, E-1. Both algorithms accept two inputs: an input block of size n bits and a key of size k bits, yielding an n-bit output block. For any one fixed key, decryption is the inverse function of encryption, so that for any block M and key K. M is termed the plaintext and C the ciphertext.

Process Initialization: n = pq, with p and q primes e relatively prime to φ(n) = (p − 1) (q − 1) d inverse of e in Zφ(n) Keys: Public key: (n, e) Private key: (n, d) Encryption: Message M 1 < M < N C = M^e mod n Decryption: M = C^d mod n

An Example Setup: p = 7, q = 17 n = 7*17 = 119 φ(n) = 6*16 = 96 e = 5 d = 77 Keys: public key: (119, 5) private key: 77 Encryption: M = 19 C = 195 mod 119 = 66 Decryption: C = 6677 mod 119 = 19

Algorithms Prime Generation Primality Tests (Miller-Rabin, etc) GCD Euler’s Totient Function Modular Multiplicative Inverse Integer Factorization (QS, Lenstra)

Development