GCD of random linear forms

Joachim Zur Von Gathen*, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We show that for arbitrary positive integers a1,.,., a m, with probability at least 6/π2 + o(l), the gcd of two linear combinations of these integers with rather small random integer coefficients coincides with gcd(a1,.,.,om). This naturally leads to a probabilistic algorithm for computing the gcd of several integers, with probability at least 6/π2 + o(l), via just one gcd of two numbers with about the same size as the initial data (namely the above linear combinations). Naturally, this algorithm can be repeated to achieve any desired confidence level.

Original languageEnglish
Pages (from-to)464-469
Number of pages6
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3341
Publication statusPublished - 2004

Fingerprint

Dive into the research topics of 'GCD of random linear forms'. Together they form a unique fingerprint.

Cite this