CSC2110%20Discrete%20Mathematics%20Tutorial%206%20Chinese%20Remainder%20Theorem%20and%20RSA - PowerPoint PPT Presentation

About This Presentation
Title:

CSC2110%20Discrete%20Mathematics%20Tutorial%206%20Chinese%20Remainder%20Theorem%20and%20RSA

Description:

CSCI2110 Discrete Mathematics Tutorial 6 Chinese Remainder Theorem and RSA Hackson Leung Announcement Project Those who have not registered, we assigned for you ... – PowerPoint PPT presentation

Number of Views:185
Avg rating:3.0/5.0
Slides: 26
Provided by: Hack75
Category:

less

Transcript and Presenter's Notes

Title: CSC2110%20Discrete%20Mathematics%20Tutorial%206%20Chinese%20Remainder%20Theorem%20and%20RSA


1
CSCI2110 Discrete MathematicsTutorial 6Chinese
Remainder Theorem and RSA
Hackson Leung
2
Announcement
  • Project
  • Those who have not registered, we assigned for
    you, please check CUHK email
  • Midterm
  • Next Monday 230pm to 400pm
  • Bring your own calculator

3
Agenda
  • Chinese Remainder Theorem
  • RSA

4
Chinese Remainder Theorem
  • Example 1
  • Solve for
  • Since
  • Then 3-1 exists and
  • Therefore,

5
Chinese Remainder Theorem
  • Example 2
  • Solve for
  • Since
  • We reduce it to
  • Same as example 1
  • What if ?
  • Contradiction!

6
Chinese Remainder Theorem
  • Example 3
  • Solve the followings, or show no solution if it
    has no solution

7
Chinese Remainder Theorem
  • Example 4
  • Solve the following, or show no solution if it
    has no solution

8
Chinese Remainder Theorem
  • Solve the following

9
Chinese Remainder Theorem
  • Consider so that
  • Step 1 Let
  • Step 2 Construct

10
Chinese Remainder Theorem
  • Step 3 Find the multiplicative inverse of
  • Remember how to find multiplicative inverse?
  • Extended Euclids Algorithm!
  • Step 4
  • Step 5 Adjust to meet the requirement

11
Chinese Remainder Theorem
  • Example 1
  • Solve for largest such that

12
Chinese Remainder Theorem
  • Step 1
  • Step 2
  • Step 3
  • Step 4
  • Step 5

13
Chinese Remainder Theorem
  • Example 2
  • Solve for such that

14
Chinese Remainder Theorem
  • Example 3
  • Solve for smallest such that

15
Chinese Remainder Theorem
  • What if
    ?
  • We can always reduce them
  • Example 4
  • Solve the largest such that

16
Chinese Remainder Theorem
  • Analyze first
  • Thus, we have

17
Chinese Remainder Theorem
  • Take a look at
  • So
  • Same as example 1
  • We want s to be relatively prime only!

18
Chinese Remainder Theorem
  • Example 5
  • Solve for smallest such that

19
Chinese Remainder Theorem
  • Example 6
  • Solve for largest such that

20
RSA
  • Step 1 , and very large
    prime
  • Step 2
  • Step 3 Choose
  • Step 4 Find
  • Public key
  • Private key

21
RSA
  • Example 1
  • Let
  • Give the public and private keys in RSA
    cryptosystem

22
RSA
  • Step 1
  • Step 2
  • Step 3 , the choice is
    ok
  • Step 4

23
RSA
  • Public key
  • Private key
  • Example 2 Encrypt 5
  • Example 3 Decrypt

24
RSA
  • Example 3

25
The End
Write a Comment
User Comments (0)
About PowerShow.com