Linearization method and linear complexity

摘要

We show that linearization method is an effective technique to calculate linear complexity. We compare the condition and necessary computational cost with Berlekamp-Massey algorithm and Games-Chan algorithm. The significant property of linearization method is that it needs no output sequence from PRNG because it calculates linear complexity by using algebraic expression of algorithm of PRNG.