Abstract:Abstract. Let p be an odd prime. Definewhere n is the multiplicative inverse of n modulo p such that 1 ≤ n ≤ p − 1. This paper shows that the sequence {e n } is a "good" pseudorandom sequence, by using the properties of exponential sums, character sums, Kloosterman sums and mean value theorems of Dirichlet L-functions.
“…Later many pseudorandom binary sequences were given and studied (see [3], [4], [6], [7], [8], [9], [11], [12], [13], [15], [16], [19], and [23]). For example, let p be an odd prime, e (1) n = n p , and E…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…The author [12] studied the pseudorandomness of E (2) p−1 . Moreover, let f (x), g(x) ∈ F p [x], and …”
Abstract. Recently P. Hubert, C. Mauduit and A. Sárközy introduced and studied the notion of pseudorandomness of binary lattices and gave a pseudorandom binary lattice. Later in other papers C. Mauduit and A. Sárközy constructed some large families of "good" binary lattices. In this paper a large family of pseudorandom binary lattices is presented by using the multiplicative inverse and the quadratic character of finite fields.
“…Later many pseudorandom binary sequences were given and studied (see [3], [4], [6], [7], [8], [9], [11], [12], [13], [15], [16], [19], and [23]). For example, let p be an odd prime, e (1) n = n p , and E…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…The author [12] studied the pseudorandomness of E (2) p−1 . Moreover, let f (x), g(x) ∈ F p [x], and …”
Abstract. Recently P. Hubert, C. Mauduit and A. Sárközy introduced and studied the notion of pseudorandomness of binary lattices and gave a pseudorandom binary lattice. Later in other papers C. Mauduit and A. Sárközy constructed some large families of "good" binary lattices. In this paper a large family of pseudorandom binary lattices is presented by using the multiplicative inverse and the quadratic character of finite fields.
“…Since that many constructions have been given for binary sequences with strong pseudorandom properties (see, e.g., [10], [11], [16], [17], [29], [30], [31], [36], [37], [39]). …”
Large families of binary sequences of the same length are considered and a new measure, the cross-correlation measure of order k is introduced to study the connection between the sequences belonging to the family. It is shown that this new measure is related to certain other important properties of families of binary sequences. Then the size of the cross-correlation measure is studied. Finally, the cross-correlation measures of two important families of pseudorandom binary sequences are estimated.
“…Later several constructions have been proposed which have good pseudorandom properties in terms of these measures: for example, the Legendre symbol sequence [4], [11]; sequences generated by the multiplicative inverse [12] and its extensions [7], [15]; the sequences generated by using elliptic curves [1], [2], [9], [16]. See also the survey paper [18].…”
Abstract. In an earlier paper, Hubert, Mauduit and Sárközy introduced and studied the notion of pseudorandomness of binary lattices. Later constructions were given by using characters and the notion of a multiplicative inverse over finite fields. In this paper a further large family of pseudorandom binary lattices is constructed by using elliptic curves.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.