PSEUDOCODE FOR FINDING THE SHORTEST MULTIPLIERS FOR THE EXTENDED GCD PROBLEM KEITH MATTHEWS Input: m positive integers d1 , . . . , dm . Output: gcd(d1 , . . . , dm ) and all multiplier vectors (y1 , . . . , ym ) ∈ Zm - Pseudocode - Document - PDFSEARCH.IO

First Page	Meta Content
	PSEUDOCODE FOR FINDING THE SHORTEST MULTIPLIERS FOR THE EXTENDED GCD PROBLEM KEITH MATTHEWS Input: m positive integers d1 , . . . , dm . Output: gcd(d1 , . . . , dm ) and all multiplier vectors (y1 , . . . , ym ) ∈ Zm Add to Reading List Document Date: 2011-11-01 22:30:18 Open Document File Size: 84,28 KB Share Result on Facebook Currency pence / / Facility University of Dortmund / / Organization University of Dortmund / / ProgrammingLanguage C / / Technology Fincke-Pohst algorithm / LLLGCD algorithm / / SocialTag Fourier analysis Multiplier

PSEUDOCODE FOR FINDING THE SHORTEST MULTIPLIERS FOR THE EXTENDED GCD PROBLEM KEITH MATTHEWS Input: m positive integers d1 , . . . , dm . Output: gcd(d1 , . . . , dm ) and all multiplier vectors (y1 , . . . , ym ) ∈ Zm Add to Reading List