Recovering zeros of polynomials modulo a prime (Q3189458): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nonlinear pseudorandom number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing noisy polynomial evaluation in residue rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring sequences produced by pseudo-random number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Truncated Integer Variables Satisfying Linear Congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attacking the Pollard Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice reduction: a toolbox for the cryptoanalyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to predict congruential generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and lattices. 1st international conference, CaLC 2001, Providence, RI, USA, March 29--30, 2001. Revised papers / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0025-5718-2014-02808-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082177344 / rank
 
Normal rank

Latest revision as of 09:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Recovering zeros of polynomials modulo a prime
scientific article

    Statements

    Recovering zeros of polynomials modulo a prime (English)
    0 references
    0 references
    0 references
    10 September 2014
    0 references
    approximation of zeros
    0 references
    bivariate polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references