Linear complexity of Legendre‐polynomial quotients
نویسندگان
چکیده
منابع مشابه
Linear complexity of Legendre-polynomial quotients
We continue to investigate binary sequence (fu) over {0, 1} defined by (−1)fu = ( (u−u)/p p ) for integers u ≥ 0, where ( · p ) is the Legendre symbol and we restrict ( 0 p ) = 1. In an earlier work, the linear complexity of (fu) was determined for w = p − 1 under the assumption of 2p−1 6≡ 1 (mod p2). In this work, we give possible values on the linear complexity of (fu) for all 1 ≤ w < p− 1 un...
متن کاملLinear complexity of binary sequences derived from polynomial quotients
We determine the linear complexity of p-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function (u−u)/p (mod p). When w = (p−1)/2 and 2p−1 6≡ 1 (mod p), we show that the linear complexity is equal to one of the following values { p − 1, p − p, (p + p)/2 + 1, (p − p)/2 } , depending whether p ≡ 1, −1, 3, −3 (mod 8). But it seems that the method can’...
متن کاملIDEALS WITH (d1, . . . , dm)-LINEAR QUOTIENTS
In this paper, we introduce the class of ideals with $(d_1,ldots,d_m)$-linear quotients generalizing the class of ideals with linear quotients. Under suitable conditions we control the numerical invariants of a minimal free resolution of ideals with $(d_1,ldots,d_m)$-linear quotients. In particular we show that their first module of syzygies is a componentwise linear module.
متن کاملOn $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients
We investigate the k-error linear complexity of pseudorandom binary sequences of period pr derived from the Euler quotients modulo pr−1, a power of an odd prime p for r ≥ 2. When r = 2, this is just the case of polynomial quotients (including Fermat quotients) modulo p, which has been studied in an earlier work of Chen, Niu and Wu. In this work, we establish a recursive relation on the k-error ...
متن کاملOn the linear complexity of binary threshold sequences derived from Fermat quotients
We determine the linear complexity of a family of p2-periodic binary threshold sequences derived fromFermat quotientsmodulo an odd prime p, where p satisfies 2p−1 ≡ 1 (mod p2). The linear complexity equals p2 − p or p2 − 1, depending whether p ≡ 1 or 3 (mod 4). Our research extends the results from previous work on the linear complexity of the corresponding binary threshold sequences when 2 is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Information Security
سال: 2018
ISSN: 1751-8709,1751-8717
DOI: 10.1049/iet-ifs.2017.0307