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 ...

This is a preview. Log in through your library . Abstract The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the ...