We give the trace representation of a family of binary sequences derived from Euler
quotients by determining the corresponding defining polynomials. The result extends an …

Linear Complexity and Trace Presentation of Sequences with Period 2P2 Page 1 Linear
complexity and trace presentation of sequences with period 2p 2 1st **gwei Zhang School of …

The Euler quotient modulo an odd-prime power $ p^ r~(r> 1) $ can be uniquely decomposed
as a $ p $-adic number of the form $$\frac {u^{(p-1) p^{r-1}}-1}{p^ r}\equiv a_0 (u)+ a_1 (u) …

We introduce the r-ary sequence with period 2p 2 derived from Euler quotients modulo 2p (p
is an odd prime) where r is an odd prime divisor of (p-1). Then based on the cyclotomic …

Based on the Euler quotient modulo 2 p (p is an odd prime), we extend the binary sequence
with period 2 p^ 2 to r-ary sequence where r is an odd prime divisor of (p-1). We determine …

In this paper, we generalize the results about the k-error linear complexity of binary
sequences derived from Euler quotients modulo pr− 1 on the q-ary sequences. We also …

We discuss the linear complexity of a family of binary threshold sequence defined by the
discrete logarithm of integers modulo a large prime. It is proved that the linear complexity is …

This work was supported in part by the Projects of International Cooperation and Exchange
National Natural Science Foundation of China and the Russian Foundation for Basic …

基于欧拉商模奇素数幂构造的伪随机序列均具有良好的密码学性质. 该文根据剩余类环理论,
利用模(为奇素数, 整数) 的欧拉商构造了一类周期为的二元序列, 并在的条件下借助有限域上 …

Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo 2<i>p^m</i>
Advanced Search Home About Journal Online Journal 1.Latest Articles 2.Current Articles 3.Archive …