31 - Chapter 31: Euclidean Algorithm Euclidean Algorithm...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #31-1 Chapter 31: Euclidean Algorithm Euclidean Algorithm Extended Euclidean Algorithm Solving ax mod n = 1 Solving ax mod n = b
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #31-2 Overview Solving modular equations arises in cryptography Euclidean Algorithm From Euclid to solving ax mod n = 1 From ax mod n = 1 to solving ax mod n = b
Background image of page 2
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #31-3 Euclidean Algorithm Given positive integers a and b , find their greatest common divisor Idea if x is the greatest common divisor of a and b , then x divides r = a b reduces problem to finding largest x that divides r and b iterate
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #31-4 Example 1 Take a = 15, b = 12 a b q r 15 12 1 3 q = 15/12 = 1 r = 15 – 1 × 12 12 3 4 0 q = 12/3 = 4 r = 12 – 4 × 3 so gcd (15, 12) = 3 The b for which r is 0
Background image of page 4
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #31-5 Example 2 Take a = 35731, b = 25689 a b q r 35731 24689 1 11042 q = 35731/24689 = 1 r = 35731–1 × 24689 24689 11042 2 2,605 q
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/04/2008 for the course CS 526 taught by Professor Wagstaff during the Fall '07 term at Purdue University-West Lafayette.

Page1 / 14

31 - Chapter 31: Euclidean Algorithm Euclidean Algorithm...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online