My (very limited) understanding of the paper
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
is that bit strings of algebraic numbers are not "cryptographically secure". The authors (Kannan, Lenstra and Lovász) write as the first sentence of the abstract:
We show that the binary expansions of algebraic numbers do not form secure pseudorandom sequences