Linear Complexity of the x2 Mod p Orbits
نویسندگان
چکیده
A lower bound for the linear complexity of sequences generated by the quadratic function x2 mod p is given. 1999 Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Reciprocity laws and Galois representations: recent breakthroughs
Suppose f(x) is a monic irreducible polynomial with integer coefficients. If p is a prime number, then reducing the coefficients of f(x) modulo p gives a new polynomial fp(x), which may be reducible. We say that f(x) is split modulo p if fp(x) is the product of distinct linear factors. Example 1.1.1. The polynomial f(x) = x2 + 1 is split modulo 5, since f5(x) ≡ (x + 2)(x + 3) mod 5. But it is n...
متن کاملStrong Approximation in the Apollonian Group
The Apollonian group is a finitely generated, infinite index subgroup of the orthogonal group OQ(Z) fixing the Descartes quadratic form Q. For nonzero v ∈ Z4 satisfying Q(v) = 0, the orbits Pv = Av correspond to Apollonian circle packings in which every circle has integer curvature. In this paper, we specify the reduction of primitive orbits Pv mod any integer d > 1. We show that this reduction...
متن کاملA practical “perfect” pseudo-random number generator
The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...
متن کاملAddendum: An analogue of Artin reciprocity for closed orbits of skew products
One of the unfulfilled aims of the authors of the preceding paper [W. Parry and M. Pollicott. An analogue of Bauer’s theorem for closed orbits of skew products. Ergod. Th. & Dynam. Sys. 28 (2008), 535–546] was to find a dynamical analogue of Artin reciprocity. In this addendum, we present one such version, suggested by work of Sunada. 0. Introduction In algebraic number theory, one of the most ...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 72 شماره
صفحات -
تاریخ انتشار 1999