Recovering zeros of polynomials modulo a prime

DOI10.1090/S0025-5718-2014-02808-1zbMATH Open1303.11129OpenAlexW2082177344MaRDI QIDQ3189458FDOQ3189458

Authors: 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

Recommendations

• Sparse polynomial approximation in finite fields
• Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
• Noisy polynomial interpolation modulo prime powers
• On some approximation problems concerning sparse polynomials over finite fields
• Interpolation and approximation of polynomials in finite fields over a short interval from noisy values

zbMATH Keywords

bivariate polynomialapproximation of zeros

Mathematics Subject Classification ID

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

Cites Work

• Geometric algorithms and combinatorial optimization
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Minkowski's Convex Body Theorem and Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Lovász' lattice reduction and the nearest lattice point problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reconstructing noisy polynomial evaluation in residue rings
• Title not available (Why is that?)
• Predicting nonlinear pseudorandom number generators
• Title not available (Why is that?)
• 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
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Lattice reduction: a toolbox for the cryptoanalyst
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Attacking the Pollard Generator
• How to predict congruential generators
• Inferring sequences produced by pseudo-random number generators
• 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 (3)

• Sparse polynomial approximation in finite fields
• Reconstructing points of superelliptic curves over a prime finite field
• Attacking the linear congruential generator on elliptic curves via lattice techniques

This page was built for publication: Recovering zeros of polynomials modulo a prime

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