1 / 14

Internet Engineering Czesław Smutnicki Discrete Mathematics – Numbers Theory

Internet Engineering Czesław Smutnicki Discrete Mathematics – Numbers Theory. CONTENT S. Basic notions Greatest common divisor Modular arithmetics Euclide an algorithm Modular equations Chinese theorem Modular powers Prime numbers RSA algorithm Decomposition into factors.

wayde
Download Presentation

Internet Engineering Czesław Smutnicki Discrete Mathematics – Numbers Theory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Internet Engineering Czesław Smutnicki DiscreteMathematics– NumbersTheory

  2. CONTENTS • Basic notions • Greatest common divisor • Modular arithmetics • Euclidean algorithm • Modular equations • Chinese theorem • Modular powers • Prime numbers • RSA algorithm • Decomposition into factors

  3. BASIC NOTIONS • Natural/integer numbers • Divisor d|a, a = kd for some integer k • d|a if and only if -d|a • Divisor: 24: 1,2,3,4,6,8,12,24 • Trivial divisors 1 and a • Prime number 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59 • Composite number, 27 (3|27) • For any integer a and any positive integer n there exist unique integers q and r, 0<=r<n so that a = qn + r • Residue r = a mod n • Division q = [a/n] • Congruence: a b (mod n) if (a mod n) = (b mod n) • Equivalence class (mod n): [a]n = {a + kn : k  Z}

  4. GREATEST COMMON DIVISOR • Common divisor: if d|a and d|b • d|(ax + by) • Relatively prime numbers a and b : gcd(a,b)=1

  5. MODULAR ARITHMETIC

  6. EUCLIDEAN ALGORITHM

  7. EUCLIDEAN ALGORITHM. INSTANCE

  8. EUCLIDEAN ALGORITHM. INSTANCE cont.

  9. MODULAR EQUATIONS EQUATION EITHER HAS d VARIOUS SOLUTIONS mod n OR DOES NOT HAVE ANY SOLUTION CASE b = 1: MULTIPLICATIVE INVERSE (IF gcd(a,n)=1 THEN IT EXISTS AND IS UNIQUE)

  10. LEAST COMMON MULTIPLIER

  11. CHINESE THEOREM

  12. MODULAR POWERS

  13. RSA ALGORITHM • Find two big prime numbers p and q • Calculate n=p*q and z=(p-1)*(q-1) • Find any number d relatively prime with z • Find number e so that (e*d) mod z=1 • Public key (e,n) • Private key (d,n) • Encryption message P Decryption C

  14. Thank you for your attention DISCRETE MATHEMATICS Czesław Smutnicki

More Related