A method for solving of polynomial congruence

MaRDI QIDQ3648040zbMATH OpenFDO

Authors Yu. L. Sachesov, N. P. Salikhov

Publication date 24 November 2009

zbMATH Keywords

linear equationsmodular equationpolynomial congruence

Mathematics Subject Classification ID

Equations in general fields (12E12) Linear equations (linear algebraic aspects) (15A06)

Recommendations

• Recursive elucidation of polynomial congruences using root-finding numerical techniques
• A note on the bivariate Coppersmith theorem
• Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables

Cited in

(1)

• Recursive elucidation of polynomial congruences using root-finding numerical techniques

This page was built for publication: A method for solving of polynomial congruence

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