A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
Mathematics of Computation
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.doi:10.1090/s0025-5718-1988-0917831-4 fatcat:roazhseeibgchepsqco3wxdirm