Reconstructing noisy polynomial evaluation in residue rings

Journal of Algorithms

Volumn 61, Issue 2, 2006, Pages 47-59

  Blackburn, Simon R ^a   Gomez Perez, Domingo ^b   Gutierrez, Jaime ^b   Shparlinski, Igor E ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF CANTABRIA   (Spain)

^c MACQUARIE UNIVERSITY   (Australia)

Author keywords

Lattice basis reduction; Noisy interpolation; Polynomial congruences; Predicting pseudorandom generators

Indexed keywords

APPROXIMATION THEORY; POLYNOMIALS; RANDOM PROCESSES; SPURIOUS SIGNAL NOISE;

LATTICE BASIS REDUCTION; NOISY INTERPOLATION; POLYNOMIAL CONGRUENCES; PREDICTING PSEUDORANDOM GENERATORS;

IMAGE RECONSTRUCTION;

EID: 34748858360     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.07.002     Document Type: Article

References (28)

1. 2 is NP-hard for randomized reductions. Proc. 30th ACM Symposium on Theory of Computing (1998), ACM 10-19
2. Ajtai M., Kumar R., and Sivakumar D. A sieve algorithm for the shortest lattice vector problem. Proc. 33rd ACM Symposium on Theory of Computing (2001), ACM 601-610
3. Blackburn S.R., Gomez-Perez D., Gutierrez J., and Shparlinski I.E. Predicting the inversive generator. Proc. 9th IMA Internat. Conf. on Cryptography and Coding. Lecture Notes in Comput. Sci. vol. 2898 (2003), Springer-Verlag, Berlin 264-275
4. S.R. Blackburn, D. Gomez-Perez, J. Gutierrez, I.E. Shparlinski, Predicting nonlinear pseudorandom number generators, Math. Comp., in press
5. Boyar J. Inferring sequences produced by pseudo-random number generators. J. ACM 36 (1989) 129-141
6. Boyar J. Inferring sequences produces by a linear congruential generator missing low-order bits. J. Cryptology 1 (1989) 177-184
7. Brickell E.F., and Odlyzko A.M. Cryptanalysis: a survey of recent results. Contemp. Cryptology (1992), IEEE Press, New York 501-540
8. Coppersmith D. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology 10 (1997) 233-260
9. Coppersmith D. Small solutions of small degree polynomials. Proc. Internat. Conf. on Cryptography and Lattices. Lecture Notes in Comput. Sci. vol. 2146 (2001), Springer-Verlag, Berlin 20-31
10. Frieze A.M., Håstad J., Kannan R., Lagarias J.C., and Shamir A. Reconstructing truncated integer variables satisfying linear congruences. SIAM J. Comput. 17 (1988) 262-280
11. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1993), Springer-Verlag, Berlin
12. Hardy G.H., and Wright E.M. An Introduction to the Theory of Numbers (1979), Oxford Univ. Press, Oxford
13. Howgrave-Graham N.A. Finding small roots of univariate modular equations revisited. Proc. 6th IMA Internat. Conf. on Cryptography and Coding. Lecture Notes in Comput. Sci. vol. 1355 (1997), Springer-Verlag, Berlin 131-142
14. Iwaniec H. On the problem of Jacobsthal. Demonstratio Math. 11 (1978) 225-231
15. Joux A., and Stern J. Lattice reduction: a toolbox for the cryptanalyst. J. Cryptology 11 (1998) 161-185
16. Kannan R. Algorithmic geometry of numbers. Ann. Review Comput. Sci. 2 (1987) 231-267
17. Kannan R. Minkowski's convex body theorem and integer programming. Math. Oper. Res. 12 (1987) 415-440
18. Knuth D.E. Deciphering a linear congruential encryption. IEEE Trans. Inform. Theory 31 (1985) 49-52
19. Konyagin S.V. On the number of solutions of an univariate congruence of nth degree. Matem. Sbornik 102 (1979) 171-187 (in Russian)
20. Krawczyk H. How to predict congruential generators. J. Algorithms 13 (1992) 527-545
21. Lagarias J.C. Pseudorandom number generators in cryptography and number theory. Proc. Symp. in Appl. Math. vol. 42 (1990), Amer. Math. Soc., Providence, RI 115-143
22. Lenstra A.K., Lenstra H.W., and Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261 (1982) 515-534
23. Micciancio D., and Goldwasser S. Complexity of Lattice Problems (2002), Kluwer Acad. Publ.
24. Nguyen P.Q., and Stern J. Lattice reduction in cryptology: an update. Proc. 4th Internat. Symp. on Algorithmic Number Theory. Lecture Notes in Comput. Sci. vol. 1838 (2000), Springer-Verlag, Berlin 85-112
25. Nguyen P.Q., and Stern J. The two faces of lattices in cryptology. Proc. Internat. Conf. on Cryptography and Lattices. Lecture Notes in Comput. Sci. vol. 2146 (2001), Springer-Verlag, Berlin 146-180
26. Niederreiter H., and Shparlinski I.E. Recent advances in the theory of nonlinear pseudorandom number generators. Proc. Conf. on Monte Carlo and Quasi-Monte Carlo Methods, 2000 (2002), Springer-Verlag, Berlin 86-102
27. Niederreiter H., and Shparlinski I.E. Dynamical systems generated by rational functions. Proc. 15th Symp. on Appl. Algebra, Algebraic Algorithms, and Error-Correcting Codes. Lecture Notes in Comput. Sci. vol. 2643 (2003), Springer-Verlag, Berlin 6-17
28. Schnorr C.P. A hierarchy of polynomial lattice basis reduction algorithms. Theoret. Comput. Sci. 53 (1987) 201-224