Fast method to getting high order polynomials
Yu Wang · Jisuanji gongcheng yu sheji · 2008
It's necessary to constructing polynomials with large period in the cipher and coding,but the computation of the period of polynomials is sub-exponential,it's very difficult to confirm the period of polynomial.In practice,we just estimate the period of the polynomials.A new prove of a famous theorem is given,about estimating the order of polynomials,throuth analysing the roots of the polynomials.The method is very simply to understand,and can be used in other problems.At last,the famous theorem is extended,and fast method to get high order polynomials is gotten.