A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback