asymmetric ciphers

34
ASYMMETRIC CIPHERS

Upload: ethel

Post on 23-Feb-2016

128 views

Category:

Documents


3 download

DESCRIPTION

ASYMMETRIC CIPHERS. Contents. INTRODUCTION TO NUMBER THEORY PUBLIC-KEYCRYPTOGRAPHY AND RSA OTHER PUBLIC-KEY CRYPTOSYSTEMS. 1. INTRODUCTION TO NUMBER THEORY. Prime Numbers Fermat’s and Euler’s Theorems Testing for Primality The Chinese Remainder Theorem Discrete Logarithms. KEY POINTS. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: ASYMMETRIC  CIPHERS

ASYMMETRIC CIPHERS

Page 2: ASYMMETRIC  CIPHERS

2

Contents

1. INTRODUCTION TO NUMBER THEORY2. PUBLIC-KEYCRYPTOGRAPHY AND RSA3. OTHER PUBLIC-KEY CRYPTOSYSTEMS

Page 3: ASYMMETRIC  CIPHERS

3

1. INTRODUCTION TO NUMBER THEORY

Prime Numbers Fermat’s and Euler’s Theorems Testing for Primality The Chinese Remainder Theorem Discrete Logarithms

Page 4: ASYMMETRIC  CIPHERS

4

KEY POINTS

A prime number is an integer that can only be divided without remainder by positive and negative values of itself and 1. Prime numbers play a critical role both in number theory and in cryptography.

Two theorems that play important roles in public-key cryptography are Fermat’s theorem and Euler’s theorem.

Page 5: ASYMMETRIC  CIPHERS

5

KEY POINTS (cont.)

An important requirement in a number of cryptographic algorithms is the ability to choose a large prime number. An area of ongoing research is the development of efficient algorithms for determining if a randomly chosen large integer is a prime number.

Discrete logarithms are fundamental to a number of public-key algorithms. Discrete logarithms are analogous to ordinary logarithms but are defined using modular arithmetic.

Page 6: ASYMMETRIC  CIPHERS

6

2. PUBLIC-KEY CRYPTOGRAPHY AND RSA

Principles Of Public-Key Cryptosystems The RSA Algorithm

Page 7: ASYMMETRIC  CIPHERS

7

KEY POINTS

Asymmetric encryption is a form of cryptosystem in which encryption and decryption are performed using the different keys—one a public key and one a private key. It is also known as public-key encryption.

Asymmetric encryption transforms plaintext into ciphertext using a one of two keys and an encryption algorithm. Using the paired key and a decryption algorithm, the plaintext is recovered from the ciphertext.

Page 8: ASYMMETRIC  CIPHERS

8

KEY POINTS (cont.)

Asymmetric encryption can be used for confidentiality, authentication, or both.

The most widely used public-key cryptosystem is RSA. The difficulty of attacking RSA is based on the difficulty of finding the prime factors of a composite number.

Page 9: ASYMMETRIC  CIPHERS

9

Terminology Related to Asymmetric Encryption

Asymmetric Keys Two related keys, a public key and a private key, that are

used to perform complementary operations, such as encryption and decryption or signature generation and signature verification.

Public Key Certificate A digital document issued and digitally signed by the

private key of a Certification Authority that binds the name of a subscriber to a public key. The certificate indicates that the subscriber identified in the certificate has sole control and access to the corresponding private key.

Page 10: ASYMMETRIC  CIPHERS

10

Terminology … (cont.)

Public Key (Asymmetric) Cryptographic Algorithm A cryptographic algorithm that uses two related keys, a

public key and a private key. The two keys have the property that deriving the private key from the public key is computationally infeasible.

Public Key Infrastructure (PKI) A set of policies, processes, server platforms, software

and workstations used for the purpose of administering certificates and public-private key pairs, including the ability to issue, maintain, and revoke public key certificates.

Page 11: ASYMMETRIC  CIPHERS

Public-Key Cryptography

11

Page 12: ASYMMETRIC  CIPHERS

12

Public-Key Cryptography (cont.)

Page 13: ASYMMETRIC  CIPHERS

13

A public-key encryption scheme has six ingredients:

Plaintext Encryption algorithm Public key Private key Ciphertext Decryption algorithm

Page 14: ASYMMETRIC  CIPHERS

14

Conventional and Public-Key Encryption

Page 15: ASYMMETRIC  CIPHERS

15

Public-Key Cryptosystem: Secrecy

Page 16: ASYMMETRIC  CIPHERS

16

Public-Key Cryptosystem: Authentication

Page 17: ASYMMETRIC  CIPHERS

17

Public-Key Cryptosystem: Authentication and Secrecy

Page 18: ASYMMETRIC  CIPHERS

18

Applications for Public-Key Cryptosystems

Page 19: ASYMMETRIC  CIPHERS

19

Public-Key Cryptanalysis

Brute-force attack compute the private key given the public key probable-message attack

Page 20: ASYMMETRIC  CIPHERS

20

THE RSA ALGORITHM

Page 21: ASYMMETRIC  CIPHERS

21

The RSA Algorithm (cont.)

Page 22: ASYMMETRIC  CIPHERS

22

RSA Processing of Multiple Blocks

Page 23: ASYMMETRIC  CIPHERS

23

The Security of RSA

Four possible approaches to attacking the RSA algorithm are Brute force: This involves trying all possible private

keys. Mathematical attacks: There are several approaches, all

equivalent in effort to factoring the product of two primes.

Timing attacks: These depend on the running time of the decryption algorithm.

Chosen ciphertext attacks: This type of attack exploits properties of the RSA algorithm.

Page 24: ASYMMETRIC  CIPHERS

24

THE FACTORING PROBLEM

Page 25: ASYMMETRIC  CIPHERS

25

Progress in Factorization

Page 26: ASYMMETRIC  CIPHERS

Lý thuyết số

Page 27: ASYMMETRIC  CIPHERS

Thuật toán Euclid mở rộng

Page 28: ASYMMETRIC  CIPHERS

Thuật toán Euclid mở rộng

Page 29: ASYMMETRIC  CIPHERS

29

3. OTHER PUBLIC-KEY CRYPTOSYSTEMS

Diffie-Hellman Key Exchange Elgamal Cryptographic System Elliptic Curve Arithmetic Elliptic Curve Cryptography Pseudorandom Number Generation Based on an

Asymmetric Cipher

Page 30: ASYMMETRIC  CIPHERS

30

KEY POINTS

A simple public-key algorithm is Diffie-Hellman key exchange. This protocol enables two users to establish a secret key using a public-key scheme based on discrete logarithms. The protocol is secure only if the authenticity of the two participants can be established.

Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptography (ECC) schemes, including key exchange, encryption, and digital signature.

For purposes of ECC, elliptic curve arithmetic involves the use of an elliptic curve equation defined over a finite field. The coefficients and variables in the equation are elements of a finite field. Schemes using Zp and GF(2^m) have been developed.

Page 31: ASYMMETRIC  CIPHERS

31

The Diffie-Hellman Key Exchange Algorithm

Page 32: ASYMMETRIC  CIPHERS

32

Key Exchange Protocols

Page 33: ASYMMETRIC  CIPHERS

33

The ElGamal Cryptosystem

Page 34: ASYMMETRIC  CIPHERS

34

The ElGamal Cryptosystem (cont.)