Recovering zeros of polynomials modulo a prime

DOI10.1090/S0025-5718-2014-02808-1zbMath1303.11129OpenAlexW2082177344MaRDI QIDQ3189458

Domingo Gomez, Jaime Gutierrez

Publication date: 10 September 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2014-02808-1

zbMATH Keywords

bivariate polynomialapproximation of zeros

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items

Attacking the linear congruential generator on elliptic curves via lattice techniques, Reconstructing points of superelliptic curves over a prime finite field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Geometric algorithms and combinatorial optimization
• Lattice reduction: a toolbox for the cryptoanalyst
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Reconstructing noisy polynomial evaluation in residue rings
• Attacking the Pollard Generator
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• Minkowski's Convex Body Theorem and Integer Programming
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Inferring sequences produced by pseudo-random number generators
• How to predict congruential generators
• Predicting nonlinear pseudorandom number generators
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Cryptography and lattices. 1st international conference, CaLC 2001, Providence, RI, USA, March 29--30, 2001. Revised papers