Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
Ravi Kannan, A. K. Lenstra, László Lovász · Mathematics of Computation · 1988
We show that the binary expansions of algebraic numbers do not form secure pseudorandom sequences; given sufficiently many initial bits of an algebraic number, its minimal polynomial can be reconstructed, and therefore the further bits of the algebraic number can be computed. This also enables us to devise a simple algorithm to factor polynomials with rational coefficients. All algorithms work in polynomial time.