Noisy Polynomial Interpolation and Noisy Chinese Remaindering

This publication has 24 references indexed in Scilit:

• Protecting secret keys with personal entropy
  Future Generation Computer Systems, 2000
• Improved decoding of Reed-Solomon and algebraic-geometry codes
  IEEE Transactions on Information Theory, 1999
• Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations
  Published by Springer Nature ,1997
• Counting points on elliptic curves over finite fields
  Journal de Théorie des Nombres de Bordeaux, 1995
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
  Mathematical Programming, 1994
• Improved low-density subset sum algorithms
  computational complexity, 1992
• Lattice points in high-dimensional spheres
  Monatshefte für Mathematik, 1990
• A hierarchy of polynomial time lattice basis reduction algorithms
  Theoretical Computer Science, 1987
• Solving low-density subset sum problems
  Journal of the ACM, 1985
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982