Public Key Cryptosystem

Slides:

Advertisements

Similar presentations

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

Advertisements

Asymmetric-Key Cryptography

7. Asymmetric encryption-

Elliptic curve arithmetic and applications to cryptography By Uros Abaz Supervised by Dr. Shaun Cooper and Dr. Andre Barczak.

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

Lect. 11: Public Key Cryptography. 2 Contents 1.Introduction to PKC 2.Hard problems  IFP  DLP 3.Public Key Encryptions  RSA  ElGamal 4.Digital Signatures.

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.

Public Key Cryptography

Public Encryption: RSA

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

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.

Codes, Ciphers, and Cryptography-RSA Encryption

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.

CSCI 398 Research Topics in Computer Science Yana Kortsarts Computer Science Department Widener University Chester, PA.

Andreas Steffen, , 4-PublicKey.pptx 1 Internet Security 1 (IntSi1) Prof. Dr. Andreas Steffen Institute for Internet Technologies and Applications.

Rachana Y. Patil 1 1.

1 Network Security Lecture 6 Public Key Algorithms Waleed Ejaz

Merkle-Hellman Knapsack Cryptosystem Merkle offered $100 award for breaking singly - iterated knapsack Singly-iterated Merkle - Hellman KC was broken by.

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.

RSA Ramki Thurimella.

Prelude to Public-Key Cryptography Rocky K. C. Chang, February

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

Chapter 21 Public-Key Cryptography and Message Authentication.

Darci Miyashiro Math 480 April 29, 2013

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.

RSA Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013.

CS461/ECE422 Spring 2012 Nikita Borisov — UIUC1.  Text Chapters 2 and 21  Handbook of Applied Cryptography, Chapter 8 

Basic Elliptic Curve Cryptography 1Lt Peter Hefley 90 OSS Instructor Fall ‘06.

Merkle-Hellman Knapsack Cryptosystem

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

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

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

Public Key Cryptosystem Introduced in 1976 by Diffie and Hellman [2] In PKC different keys are used for encryption and decryption 1978: First Two Implementations.

Lecture 9 Elliptic Curves. In 1984, Hendrik Lenstra described an ingenious algorithm for factoring integers that relies on properties of elliptic curves.

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

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

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

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

ECE454/599 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2012.

Public Key Cryptosystem In Symmetric or Private Key cryptosystems the encryption and decryption keys are either the same or can be easily found from each.

Public Key Cryptography. Asymmetric encryption is a form of cryptosystem in which Encryption and decryption are performed using the different keys—one.

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

@Yuan Xue CS 285 Network Security Public-Key Cryptography Yuan Xue Fall 2012.

Asymmetric-Key Cryptography

Public Key Encryption.

ASymmetric Key Algorithms

Asymmetric-Key Cryptography

Network Security Design Fundamentals Lecture-13

RSA Slides by Kent Seamons and Tim van der Horst

Network Security Unit-III

PUBLIC-KEY ENCRYPTION Focusing on RSA

Public-Key Cryptography and RSA

RSA and El Gamal Cryptosystems

Modular Arithmetic and RSA Encryption

Input: A={a1, a2, … an} – public key, S - ciphertext

Symmetric-Key Cryptography

Appendix 5: Cryptography p

MSIT 543 Cryptography Concepts and Techniques How RSA Encryption Works

Introduction to Elliptic Curve Cryptography

Symmetric-Key Cryptography

Cryptology Design Fundamentals

Network Security Design Fundamentals Lecture-13

Campbell R. Harvey Duke University and NBER

Presentation transcript:

Public Key Cryptosystem Introduced in 1976 by Diffie and Hellman [2] In PKC different keys are used for encryption and decryption 1978: First Two Implementations RSA: Rivest-Shamir-Adleman ACM 2002 Turing Award Based on integer factorization Merkle-Hellman Knapsack Cryptosystem [1] Based on the subset-sum problem, variant of knapsack problem Additive Knapsack Cryptosystem Multiplicative Knapsack Cryptosystem Multiply-Iterated Knapsack Cryptosystem

Public Key Cryptosystems Elliptic curve cryptography (ECC) is an approach to PKC based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz and Victor S. Miller in 1985. The NTRUEncrypt public key cryptosystem, also known as the NTRU encryption algorithm, is a lattice-based alternative to RSA and ECC and is based on the shortest vector problem in a lattice.

Public Key Cryptosystems ElGamal encryption system is an asymmetric key encryption algorithm for PKC which is based on the Diffie–Hellman key exchange. It was described by Taher Elgamal in 1985. The Digital Signature Algorithm (DSA) is a United States Federal Government standard or FIPS for digital signatures.

RSA Alice: 1. Chooses secret (private) key 2. Create and publishes public key 3. Receives ciphertext from Bob 4. Decrypts ciphertext using secret key to recover the plaintext – original message Bob 1. Uses Alice Public Key to encrypt the message 2. Sends ciphertext – encrypted message to Alice

ALICE Preparation Step – Creates Private and Public Key Selects two primes p and q Calculates m = pq n = ( p – 1 ) ( q – 1 ) Selects e (1 < e < n), that relatively prime to n, gcd (e, n) = 1 Finds the multiplicative inverse of e mod n. Denotes the multiplicative inverse by d: ed  1 (mod n) Publishes e and m – this is the public key

BOB - Encryption Plaintext is number x 0 < x  m -1 gcd (x, m) =1 Ciphertext y is calculated as follows: y = xe mod m y is sent to Alice

Alice - Decryption Alice receives the ciphertext y Calculates yd mod m and this is a plaintext x, so the final formula is: x  yd ( mod m )