A new modular interpolation algorithm for factoring multivariate polynomials

Ronitt Rubinfeld, Richard Zippel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we present a technique that uses a new interpolation scheme to reconstruct a multivariate polynomial factorization from a number of univariate factorizations. Whereas other interpolation algorithms for polynomial factorization depend on various extensions of the Hilbert irreducibility theorem, our approach is the first to depend only upon the classical formulation. The key to our technique is the interpolation scheme for multivalued black boxes originally developed by Ar et. al. [1]. We feel that this combination of the classical Hilbert irreducibility theorem and multivalued black boxes provides a particularly simple and intuitive approach to polynomial factorization.

Original languageEnglish
Title of host publicationAlgorithmic Number Theory - 1st International Symposium, ANTS-I, Proceedings
EditorsLeonard M. Adleman, Ming-Deh Huang
PublisherSpringer Verlag
Pages93-107
Number of pages15
ISBN (Print)9783540586913
DOIs
StatePublished - 1994
Externally publishedYes
Event1st Algorithmic Number Thoery Symposium, ANTS-I 1994 - Ithaca, United States
Duration: 6 May 19949 May 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume877 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st Algorithmic Number Thoery Symposium, ANTS-I 1994
Country/TerritoryUnited States
CityIthaca
Period6/05/949/05/94

Fingerprint

Dive into the research topics of 'A new modular interpolation algorithm for factoring multivariate polynomials'. Together they form a unique fingerprint.

Cite this