Recovering zeros of polynomials modulo a prime

DOI10.1090/S0025-5718-2014-02808-1MaRDI QIDQ3189458zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)