The main purpose of this paper is using the properties of the classical Gauss sum and the analytic methods to study the computational problem of one kind of hybrid power mean involving the character sum of polynomials...The main purpose of this paper is using the properties of the classical Gauss sum and the analytic methods to study the computational problem of one kind of hybrid power mean involving the character sum of polynomials and a sum analogous to Kloosterman sum mod p,an odd prime,and give two sharp asymptotic formulae for them.展开更多
The main purpose of this paper is to study the mean value properties of the character sums over the interval [1,p/8） by using the mean value theorems of the Dirichlet L-functions, and give an interesting mean value f...The main purpose of this paper is to study the mean value properties of the character sums over the interval [1,p/8） by using the mean value theorems of the Dirichlet L-functions, and give an interesting mean value formula for this study.展开更多
The main purpose of this paper is using the analytic method and the properties of the character sums to study the computational problem of one kind hybrid power mean involving the character sums of polynomials and the...The main purpose of this paper is using the analytic method and the properties of the character sums to study the computational problem of one kind hybrid power mean involving the character sums of polynomials and the two-term exponential sums,and give several interesting identities and asymptotic formulae for them.展开更多
We estimate weighted character sums with determinants ad-bc of 2×2 matrices modulo a prime p with entries a,b,c and d vary ing over the interval [1,N].Our goal is to obtain non-trivial bounds for values of N as s...We estimate weighted character sums with determinants ad-bc of 2×2 matrices modulo a prime p with entries a,b,c and d vary ing over the interval [1,N].Our goal is to obtain non-trivial bounds for values of N as small as possible.In particular,we achieve this goal,with a power saving,for N≥p^(1/8+ε) with any fixed ε>0,which is very likely to be the best possible unless the celebrated Burgess bound is improved,By other techniques,we also treat more general sums but sometimes for larger values of N.展开更多
This paper shows a connection between exponential sums and character sums. In particular, we introduce a character sum that is an analog of the classical Kloosterman sums and establish the analogous Weil-Estermann...This paper shows a connection between exponential sums and character sums. In particular, we introduce a character sum that is an analog of the classical Kloosterman sums and establish the analogous Weil-Estermann's upper bound for it. The paper also analyzes a generalized Hardy-Littlewood example for character sums, which shows that the upper bounds given here are the best possible. The analysis makes use of local bounds for the exponential sums and character sums. The basic theorems have been previously established.展开更多
We obtain formulae and estimates for character sums of the type $S\left( {\chi ,f,p^m } \right) = \sum\nolimits_{x = 1}^{p^m } {\chi \left( {f\left( x \right)} \right),} $ where pm is a prime power with m S 2, L is a ...We obtain formulae and estimates for character sums of the type $S\left( {\chi ,f,p^m } \right) = \sum\nolimits_{x = 1}^{p^m } {\chi \left( {f\left( x \right)} \right),} $ where pm is a prime power with m S 2, L is a multiplicative character (mod p^m), and f=f1/f2 is a rational function over ê. In particular, if p is odd, d=deg(f1)+deg(f2) and d* = max(deg(f1), deg(f2)) then we obtain $\left| {S\left( {\chi ,f,p^m } \right)} \right| \le \left( {d - 1} \right)p^{m\left( {1 - {1 \over {d*}}} \right)}$ for any non-constant f (mod p) and primitive character L. For p = 2 an extra factor of $2\sqrt 2$ is needed.展开更多
Hua’s estimate is established for character sums in a number field.A relationship between liftings of a character sum in a local field is also studied.
We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseu...We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseudorandom measures, such as the well-distribution measure, the correlation measure of order e, and the linear complexity are estimated by using certain character sums. Such sequences share the same order of magnitude on the well-distribution measure, the correlation measure of order e as the ＇truly＇ random sequences. The method indicates that it is possible to construct ＇good＇ pseudorandom sequences over elliptic curves widely used in public key cryptography.展开更多
Let ε ： y^2 = x3 ＋ Ax ＋ B be an elliptic curve defined over the finite field Zp（p 〉 3） and G be a rational point of prime order N on ε. Define a subset of ZN, the residue class ring modulo N, asS：={n：n∈ZN,n...Let ε ： y^2 = x3 ＋ Ax ＋ B be an elliptic curve defined over the finite field Zp（p 〉 3） and G be a rational point of prime order N on ε. Define a subset of ZN, the residue class ring modulo N, asS：={n：n∈ZN,n≠0,（X（nG）/p）=1} where X（nG） denotes the x-axis of the rational points nC and （＊/P） is the Legendre symbol. Some explicit results on quasi-randomness of S are investigated. The construction depends on the intrinsic group structures of elliptic curves and character sums along elliptic curves play an important role in the proofs.展开更多
Given a positive integer n and the residue class ring Z_(n)=Z/nZ,we set Z_(n)^(x)to be the group of units in Z_(n),i.e.,Z_(n)^(x)={x∈Z_(n):ged(x,n)=1}.Let N_(m)(n)be the number of solutions of x_(1)^(4)+…+x_(m)^(4)...Given a positive integer n and the residue class ring Z_(n)=Z/nZ,we set Z_(n)^(x)to be the group of units in Z_(n),i.e.,Z_(n)^(x)={x∈Z_(n):ged(x,n)=1}.Let N_(m)(n)be the number of solutions of x_(1)^(4)+…+x_(m)^(4)≡0(mod n)with x_(1),…,x_(m)∈Z_(n)^(x).In this note,we determine an explicit expression of N_(m)(n).This extends the results of Sun and Yang in 2014.展开更多
Based on the quadratic exponential method, this paper constructs two types of generators over finite field Fq, the digital quadratic exponential generator and quadratic exponential pseudorandom vector generator. We in...Based on the quadratic exponential method, this paper constructs two types of generators over finite field Fq, the digital quadratic exponential generator and quadratic exponential pseudorandom vector generator. We investigate the distribution of the sequence generated by the generators, and present results about their one dimensional discrepancy. The proofs are based on the estimate of certain character sum over Fq. Ift is the least period of the sequence and t≥q^1/2＋2c, then the bound of the discrepancy is O（t^-1/4q^1/8＋τ logq） for any ε 〉 0. It shows that the sequence is asymptotically uniformly distributed.展开更多
The main purpose of this article is using the elementary techniques and the properties of the character sums to study the computational problem of one kind products of Gauss sums,and give an interesting triplication f...The main purpose of this article is using the elementary techniques and the properties of the character sums to study the computational problem of one kind products of Gauss sums,and give an interesting triplication formula for them.展开更多
The main purpose of this paper is using residue system and character sums methods to investigate the mean value properties of general k-th Gauss sums,and two exact calculating formulas are given.
For an odd prime p, a new sequence family of period prom- 1, size （M-1）pmr is proposed using multi-plicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the seque...For an odd prime p, a new sequence family of period prom- 1, size （M-1）pmr is proposed using multi-plicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the sequence family is derived using well-known character sums. The upper bound is shown to be （r ＋ 1）√pm ＋ 3, which meets the Welch bound asymptotically.展开更多
Using the estimates of character sums over Galoi8 rings and the trace de-scription of primitive sequences over Z_(p^e), we obtain an estimate for the frequency of theoccurrences of any element in Z_(p^e) in one period...Using the estimates of character sums over Galoi8 rings and the trace de-scription of primitive sequences over Z_(p^e), we obtain an estimate for the frequency of theoccurrences of any element in Z_(p^e) in one period of a primitive sequence, which is betterthan Kuzmin's results if n >4e, where n is the degree of the generating polynomial ofthe primitive sequence.展开更多
The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum es...The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, we show that the error distance can be determined precisely when the degree of the received word is small. As an application of our method, we give a significant improvement of the recent bound of Cheng-Murray on non-existence of deep holes (words with maximal error distance).展开更多
We review the constructions of two main kinds of generalized cyclotomic binary sequences with length pq （the product with two distinct primes）. One is the White-generalized cyclotomic sequences, the other is the Din...We review the constructions of two main kinds of generalized cyclotomic binary sequences with length pq （the product with two distinct primes）. One is the White-generalized cyclotomic sequences, the other is the Ding-Helleseth（DH, for short）-generalized cyclotomic sequences. We present some new pseudo-random properties of DH-generalized cyclotomic sequences using the theory of character sums instead of the theory of cyclotomy, which is a conventional method for investigating generalized cyclotomic sequences.展开更多
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k sym...The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.展开更多
基金Supported by NSFC(No.12126357)Natural Science Basic Research Plan in Shaanxi Province of China(No.2023-JC-QN-0058)。
文摘The main purpose of this paper is using the properties of the classical Gauss sum and the analytic methods to study the computational problem of one kind of hybrid power mean involving the character sum of polynomials and a sum analogous to Kloosterman sum mod p,an odd prime,and give two sharp asymptotic formulae for them.
文摘The main purpose of this paper is to study the mean value properties of the character sums over the interval [1,p/8） by using the mean value theorems of the Dirichlet L-functions, and give an interesting mean value formula for this study.
基金Supported by NSF(Grant Nos.11771351 and 11826205)
文摘The main purpose of this paper is using the analytic method and the properties of the character sums to study the computational problem of one kind hybrid power mean involving the character sums of polynomials and the two-term exponential sums,and give several interesting identities and asymptotic formulae for them.
基金supported in part by the Australian Research Council (Grant No. DP200100355)。
文摘We estimate weighted character sums with determinants ad-bc of 2×2 matrices modulo a prime p with entries a,b,c and d vary ing over the interval [1,N].Our goal is to obtain non-trivial bounds for values of N as small as possible.In particular,we achieve this goal,with a power saving,for N≥p^(1/8+ε) with any fixed ε>0,which is very likely to be the best possible unless the celebrated Burgess bound is improved,By other techniques,we also treat more general sums but sometimes for larger values of N.
基金Supported by the National Natural Science Foundationof China(No.196 2 5 10 2 ) and partially by the National"973"Project of China
文摘This paper shows a connection between exponential sums and character sums. In particular, we introduce a character sum that is an analog of the classical Kloosterman sums and establish the analogous Weil-Estermann's upper bound for it. The paper also analyzes a generalized Hardy-Littlewood example for character sums, which shows that the upper bounds given here are the best possible. The analysis makes use of local bounds for the exponential sums and character sums. The basic theorems have been previously established.
文摘We obtain formulae and estimates for character sums of the type $S\left( {\chi ,f,p^m } \right) = \sum\nolimits_{x = 1}^{p^m } {\chi \left( {f\left( x \right)} \right),} $ where pm is a prime power with m S 2, L is a multiplicative character (mod p^m), and f=f1/f2 is a rational function over ê. In particular, if p is odd, d=deg(f1)+deg(f2) and d* = max(deg(f1), deg(f2)) then we obtain $\left| {S\left( {\chi ,f,p^m } \right)} \right| \le \left( {d - 1} \right)p^{m\left( {1 - {1 \over {d*}}} \right)}$ for any non-constant f (mod p) and primitive character L. For p = 2 an extra factor of $2\sqrt 2$ is needed.
文摘Hua’s estimate is established for character sums in a number field.A relationship between liftings of a character sum in a local field is also studied.
基金Supported by the National Natural Science Foundation of China (61063041)the Program for New Century Excellent Talents in Fujian Province University (JK2010047)the Open Funds of State Key Laboratory of Information Security (01-01-1)
文摘We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseudorandom measures, such as the well-distribution measure, the correlation measure of order e, and the linear complexity are estimated by using certain character sums. Such sequences share the same order of magnitude on the well-distribution measure, the correlation measure of order e as the ＇truly＇ random sequences. The method indicates that it is possible to construct ＇good＇ pseudorandom sequences over elliptic curves widely used in public key cryptography.
基金Supported by the National Natural Science Foundation of China(No.61170246)the Program for New Century Excellent Talents in Fujian Province University of China(No.JK2010047)the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)(No.01-01-1)
文摘Let ε ： y^2 = x3 ＋ Ax ＋ B be an elliptic curve defined over the finite field Zp（p 〉 3） and G be a rational point of prime order N on ε. Define a subset of ZN, the residue class ring modulo N, asS：={n：n∈ZN,n≠0,（X（nG）/p）=1} where X（nG） denotes the x-axis of the rational points nC and （＊/P） is the Legendre symbol. Some explicit results on quasi-randomness of S are investigated. The construction depends on the intrinsic group structures of elliptic curves and character sums along elliptic curves play an important role in the proofs.
基金Supported by the Natural Science Foundation of Henan Province(232300420123)the National Natural Science Foundation of China(12026224)。
文摘Given a positive integer n and the residue class ring Z_(n)=Z/nZ,we set Z_(n)^(x)to be the group of units in Z_(n),i.e.,Z_(n)^(x)={x∈Z_(n):ged(x,n)=1}.Let N_(m)(n)be the number of solutions of x_(1)^(4)+…+x_(m)^(4)≡0(mod n)with x_(1),…,x_(m)∈Z_(n)^(x).In this note,we determine an explicit expression of N_(m)(n).This extends the results of Sun and Yang in 2014.
基金Supported by the Special Fund of National Excellent Doctoral Dissertation (Grant 200060) and the National Natural Science Foundation of China (No.60373092).
文摘Based on the quadratic exponential method, this paper constructs two types of generators over finite field Fq, the digital quadratic exponential generator and quadratic exponential pseudorandom vector generator. We investigate the distribution of the sequence generated by the generators, and present results about their one dimensional discrepancy. The proofs are based on the estimate of certain character sum over Fq. Ift is the least period of the sequence and t≥q^1/2＋2c, then the bound of the discrepancy is O（t^-1/4q^1/8＋τ logq） for any ε 〉 0. It shows that the sequence is asymptotically uniformly distributed.
基金Supported by National Natural Science Foundation of China(Grant No.12126357)。
文摘The main purpose of this article is using the elementary techniques and the properties of the character sums to study the computational problem of one kind products of Gauss sums,and give an interesting triplication formula for them.
基金Supported by the National Natural Science Foundation of China (Grant No.11071194)the Northwest University Doctorate Dissertation of Excellence Funds (Grant No.09YYB05)
文摘The main purpose of this paper is using residue system and character sums methods to investigate the mean value properties of general k-th Gauss sums,and two exact calculating formulas are given.
文摘For an odd prime p, a new sequence family of period prom- 1, size （M-1）pmr is proposed using multi-plicative and additive characters. The upper bound for the maximum magnitude of nontrivial correlations of the sequence family is derived using well-known character sums. The upper bound is shown to be （r ＋ 1）√pm ＋ 3, which meets the Welch bound asymptotically.
文摘Using the estimates of character sums over Galoi8 rings and the trace de-scription of primitive sequences over Z_(p^e), we obtain an estimate for the frequency of theoccurrences of any element in Z_(p^e) in one period of a primitive sequence, which is betterthan Kuzmin's results if n >4e, where n is the degree of the generating polynomial ofthe primitive sequence.
文摘The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, we show that the error distance can be determined precisely when the degree of the received word is small. As an application of our method, we give a significant improvement of the recent bound of Cheng-Murray on non-existence of deep holes (words with maximal error distance).
基金supported in part by the Open Funds of Key Lab of Fujian Province University Network Security and Cryptology(Grant No. 07B005)the Funds of the Education Department of Fujian Province (Grant No. JA07164) the Natural Science Foundation of Fujian Province of China (Grant No. 2007F3086).
文摘We review the constructions of two main kinds of generalized cyclotomic binary sequences with length pq （the product with two distinct primes）. One is the White-generalized cyclotomic sequences, the other is the Ding-Helleseth（DH, for short）-generalized cyclotomic sequences. We present some new pseudo-random properties of DH-generalized cyclotomic sequences using the theory of character sums instead of the theory of cyclotomy, which is a conventional method for investigating generalized cyclotomic sequences.
基金supported by the National Natural Science Foundation of China under Grant No. 61063041the Program for New Century Excellent Talents of Universities in Fujian Province under Grant No. JK2010047the Funds of the Education Department of Gansu Province under Grant No. 1001-09
文摘The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.
