This paper proves that if qn is large enough, for each element a and primitive element b of Fq, there etists a primitive polynomial of degree n ≥5 over the finite field Fq having a as the coefficient of xn-1 and b as...This paper proves that if qn is large enough, for each element a and primitive element b of Fq, there etists a primitive polynomial of degree n ≥5 over the finite field Fq having a as the coefficient of xn-1 and b as the constant term. This proves that if qn is large enongh, for each element a ∈Fq, there exists a primitive polynomial of degree n ≥ 5 over Fq having a as the coefficient of x.展开更多
In this paper, we introduce a new type of feedback shift register based on words, called G-linear feedback shift register (σ-LFSR) which can make full use of the instructions of modern CPUs so that we can find good...In this paper, we introduce a new type of feedback shift register based on words, called G-linear feedback shift register (σ-LFSR) which can make full use of the instructions of modern CPUs so that we can find good σ-LFSR with simple structure and fast software implementation. After analysis, we find a class of simple σ-LFSR with maximal period and give an algorithm of searching for those σ-LFSRs. As a result, we provide a new optional fast component in the design of modern wordbased stream ciphers.展开更多
基金This work is supported by project number 1998-015-D00015.
文摘This paper proves that if qn is large enough, for each element a and primitive element b of Fq, there etists a primitive polynomial of degree n ≥5 over the finite field Fq having a as the coefficient of xn-1 and b as the constant term. This proves that if qn is large enongh, for each element a ∈Fq, there exists a primitive polynomial of degree n ≥ 5 over Fq having a as the coefficient of x.
基金the National Natural Science Foundation of China (Grant No. 60503011)the National High-Tech Research and Development Program of China (863 Program) (Grant No. 2006AA01Z425)the National Basic Research Program of China (973 Program) (Grant No. 2007CB807902)
文摘In this paper, we introduce a new type of feedback shift register based on words, called G-linear feedback shift register (σ-LFSR) which can make full use of the instructions of modern CPUs so that we can find good σ-LFSR with simple structure and fast software implementation. After analysis, we find a class of simple σ-LFSR with maximal period and give an algorithm of searching for those σ-LFSRs. As a result, we provide a new optional fast component in the design of modern wordbased stream ciphers.