A strategy for recovering roots of bivariate polynomials modulo a

A strategy for recovering roots of bivariate polynomials modulo a

Cached

Download Links

[eprint.iacr.org]

by Paula Bustillo , Domingo Gómez , Jaime Gutierrez , Álvar Ibeas

BibTeX

@MISC{Bustillo_astrategy,
    author = {Paula Bustillo and Domingo Gómez and Jaime Gutierrez and Álvar Ibeas},
    title = {A strategy for recovering roots of bivariate polynomials modulo a},
    year = {}
}

Bookmark

OpenURL

Abstract

prime

Citations

969	Geometric algorithms and combinatorial optimization - Grötschel, Lovász, et al. - 1993
177	On Lovász’ lattice reduction and the nearest lattice point problem - Babai - 1986
142	Small Solutions to Polynomial Equations, and Low Exponent Vulnerabilities - Coppersmith - 1997
28	Reconstructing truncated integer variables satisfying linear congruences - Frieze, H˚astad, et al. - 1988
25	Finding small solutions to small degree polynomials - Coppersmith
23	Inferring sequences produced by pseudo-random number generators - Boyar - 1989
11	Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach - Coron
11	A Strategy for Finding Roots of Multivariate Polynomials with New Applications - Jochemsz, May - 2006
10	N.: The Modular Inversion Hidden Number Problem - Boneh, Halevi, et al. - 2001
7	A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers - Blömer, May - 2005
1	and Álvar Ibeas. Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits. Des - Gutierrez - 2007