An algorithm for finding small roots of multivariate polynomials over the integers

MaRDI QIDQ3400699zbMATH OpenFDO

Authors

Publication date 5 February 2010

zbMATH Keywords

lattice reductionRSA attackinteger polynomial roots

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Solving polynomial systems; resultants (13P15)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1182510
• scientific article; zbMATH DE number 1852134
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers

Cited in

(9)

• Finding small roots for bivariate polynomials over the ring of integers
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• scientific article; zbMATH DE number 1303120 (Why is no real title available?)
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1852134 (Why is no real title available?)
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences

This page was built for publication: An algorithm for finding small roots of multivariate polynomials over the integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400699)