We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published bySeth Craner
Modified about 1 year ago
Euclidean Algorithm Applied Symbolic Computation CS 567 Jeremy Johnson
Greatest Common Divisors g = gcd(a,b) – g|a and g|b – e|a and e|b e|g
Unique Factorization p|ab p|a or p|b a = p 1 p t = q 1 q s s = t and i j: p i = q j a = p 1 e1 p t et b = p 1 f1 p t ft gcd(a,b) = p 1 min(e1,f1) p t min(et,ft)
Bezout’s Identity g = gcd(a,b) x,y: g = ax + by
Bezout’s Identity g = gcd(a,b) x,y: g = ax + by
Euclidean Algorithm g = gcd(a,b) if (b = 0) then return a; else return gcd(b,a mod b)
Tail Recursion g = gcd(a,b) if (b = 0) then return a; else return gcd(b,a mod b)
Iterative Algorithm g = gcd(a,b) a1 = a; a2 = b; while (a2 0) a3 = a1 mod a2; a1 = a2; a2 = a3; } return a1;
Remainder Sequence a 1 = a, a 2 = b a 1 = q 3 a 2 + a 3, 0 a 3 < a 2 a i = q i a i+1 + a i+2, 0 a i+2 < a i+1 a n = q n a n+1 gcd(a,b) = a n+1
Bounding Number of Divisions Theorem. Let a b 0 and n = number of divisions required by the Euclidean algorithm to compute gcd(a,b). Then n < 2lg(a).
Bounding Number of Divisions
Fibonacci Numbers F 0 = 0, F 1 = 1 F n+2 = F n+1 + F n
Solving the Fibonacci Recurrence F n = 1/ 5( n + * n ), = (1 + 5)/2, * = (1 - 5)/2 F n 1/ 5 n+1
Solving the Fibonacci Recurrence
Maximum Number of Divisions Theorem. The smallest pair of integers that require n divisions to compute their gcd is F n+2 and F n+1.
Maximum Number of Divisions Theorem. Let a b 0 and n = number of divisions required by the Euclidean algorithm to compute gcd(a,b). Then n < 1.44 lg(a).
Maximum Number of Divisions
Extended Euclidean Algorithm g = gcd(a,b,*x,*y) a1 = a; a2 = b; x1 = 1; x2 = 0; y1 = 0; y2 = 1; while (a2 0) a3 = a1 mod a2; q = floor(a1/a2); x3 = x1 – q*x2; y3 = y1 – q*y2; a1 = a2; a2 = a3; x1 = x2; x2 = x3; y1 = y2; y2 = y3; } return a1;
Probability of Relative Primality p/d 2 = 1 p = 1/ (2) (z) = 1/n z (2) = 2 /6
Formal Proof Let q n be the number of 1 a,b n such that gcd(a,b) = 1. Then lim n q n /n 2 = 6/ 2
Mobius Function (1) = 1 (p 1 p t ) = -1 t (n) = 0 if p 2 |n (ab) = (a) (b) if gcd(a,b) = 1.
Mobius Inversion d|n (d) = 0 ( n (n)n s ) ( n 1/n s ) = 1
Formal Proof q n = n n/k 2 lim n q n /n 2 = n (n)n 2 = n 1/n 2 = 6/ 2
Continued Fractions, Euclidean Algorithm and Lehmer’s Algorithm Applied Symbolic Computation CS 567 Jeremy Johnson TexPoint fonts used in EMF. Read the.
Divide & Conquer Themes –Reasoning about code (correctness and cost) –iterative code, loop invariants, and sums –recursion, induction, and recurrence relations.
1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find.
Richard Fateman CS 282 Lecture eea1 Extended Euclidean Algorithm Lecture eea.
MAT 320 Spring 2008 Section 1.2. Start with two integers for which you want to find the GCD. Apply the division algorithm, dividing the smaller number.
Ref: Pfleeger96, Ch.31 Properties of Arithmetic Reference: Pfleeger, Charles P., Security in Computing, 2nd Edition, Prentice Hall, 1996.
6/20/2015 5:05 AMNumerical Algorithms1 x x1x
Rational Numbers and Fields. Integers – Well ordered integral domain Can we solve any linear equation over the integers? Example: x + 5 = 7 3x + 5 = 11.
Divisibility October 8, Divisibility If a and b are integers and a 0, then the statement that a divides b means that there is an integer c such.
Quotient-Remainder Theory, Div and Mod 1. Exercise 2.
1 Lect. 12: Number Theory. Contents Prime and Relative Prime Numbers Modular Arithmetic Fermat’s and Euler’s Theorem Extended Euclid’s Algorithm.
1 Network and Computer Security (CS 475) Modular Arithmetic Jeremy R. Johnson.
Chapter II. THE INTEGERS 2.3 Divisibility 2.4 Prime and Greatest Common Divisor 2.5 Congruence of Integers 2.6 Congruence Classes.
CSE 311 Foundations of Computing I Lecture 14 Euclid’s Algorithm Mathematical Induction Autumn 2012 CSE
Module :MA3036NI Cryptography and Number Theory Lecture Week 7.
CSE 311: Foundations of Computing Fall 2014 Lecture 12: Primes, GCD.
NUMBER THEORY Chapter 1: The Integers. The Well-Ordering Property.
Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.
Copyright © Zeph Grunschlag, Basic Number Theory Zeph Grunschlag.
Agenda Review: Relation Properties Lecture Content: Divisor and Prime Number Binary, Octal, Hexadecimal Review & Exercise.
CSE 311: Foundations of Computing Fall 2013 Lecture 12: Primes, GCD, modular inverse.
Recursion CS-240/CS341. What is recursion? a function calls itself –direct recursion a function calls its invoker –indirect recursion f f1 f2.
Chinese Remainder Theorem. How many people What is x? Divided into 4s: remainder 3 x ≡ 3 (mod 4) Divided into 5s: remainder 4 x ≡ 4 (mod 5) Chinese Remainder.
CSE 311 Foundations of Computing I Lecture 12 Primes, GCD, Modular Inverse Spring
CSE 311 Foundations of Computing I Lecture 13 Number Theory Autumn 2012 CSE
Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.
Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.
CS 312: Algorithm Analysis Lecture #4: Primality Testing, GCD This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.Creative.
February 19, 2015Applied Discrete Mathematics Week 4: Number Theory 1 The Growth of Functions Question: If f(x) is O(x 2 ), is it also O(x 3 )? Yes. x.
Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,
1 Network and Computer Security (CS 475) Modular Arithmetic and the RSA Public Key Cryptosystem Jeremy R. Johnson.
October 1, 2009Theory of Computation Lecture 8: Primitive Recursive Functions IV 1 Primitive Recursive Predicates Theorem 6.1: Let C be a PRC class. If.
Scott CH Huang COM5336 Cryptography Lecture 11 Euclidean Domains & Division Algorithm Scott CH Huang COM 5336 Cryptography Lecture 10.
9/2/2015Discrete Structures1 Let us get into… Number Theory.
Application: Algorithms Lecture 20 Section 3.8 Wed, Feb 21, 2007.
Advanced Algebraic Algorithms on Integers and Polynomials Prepared by John Reif, Ph.D. Analysis of Algorithms.
MA/CSSE 473 Day 08 Extended Euclid's Algorithm Modular Division Fermat's little theorem.
CompSci 102 Discrete Math for Computer Science February 23, 2012 Prof. Rodger.
Chinese Remainder Theorem Dec 29 Picture from ………………………
Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices Algorithm: specifying a sequence of steps used to solve a problem. Computational complexity.
February 24, 2015Applied Discrete Mathematics Week 4: Number Theory 1 Modular Arithmetic Let a be an integer and m be a positive integer. We denote by.
Cryptography Inverses and GCD Piotr Faliszewski. GCD(a,b) gcd(a, 0) = a gcd(a, b) = gcd(b, a mod b) a = b*q + r Here: q = a / b r = a mod b (a –
Ryan Henry I 538 /B 609 : Introduction to Cryptography.
Lecture 6.1: Misc. Topics: Number Theory CS 250, Discrete Structures, Fall 2011 Nitesh Saxena.
Chapter 4 – Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public.
Application: Algorithms Lecture 19 Section 3.8 Tue, Feb 20, 2007.
Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.
© 2017 SlidePlayer.com Inc. All rights reserved.