Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties. The linear complexity of a period sequence plays a fundamental ...Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. Let p, q, and r be distinct odd primes with gcd（p-1, q-1 ）=gcd（p- 1, r-1）=gcd（q-1, r-1）=2. In this paper, a new class of generalized cyclotomic sequence with respect to pqr over GF（2） is constructed by finding a special characteristic set. In addition, we determine its linear complexity using cyclotomic theory. Our results show that these sequences have high linear complexity, which means they can resist linear attacks.展开更多
Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternar...Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.展开更多
Pseudo-random sequences are used extensively for their high speed and security level and less errors. As a branch, the cyclotomic sequences and the generalized ones are studied widely because of their simple mathemati...Pseudo-random sequences are used extensively for their high speed and security level and less errors. As a branch, the cyclotomic sequences and the generalized ones are studied widely because of their simple mathematical structures and excellent pseudo-random properties. In 1998, Ding and Helleseth introduced a new generalized cyclotomy which includes the classical cyclotomy as a special case. In this paper, based on the generalized cyclotomy, new generalized cyclotomic sequences with order two and length pq are constructed. An equivalent definition of the sequences is deduced so that the autocorrelation values of these sequences can be determined conveniently. The construction contributes to the understanding of the periodic autocorrelation structure of cyclotomically-constructed binary sequences, and the autocorrelation function takes on only a few values.展开更多
Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diopha...Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diophantine equations.展开更多
The well-known binary Legendre sequences possess good autocorrelation functions and high linear complexity, and are just special cases of much larger families of cyclotomic sequences. Prime-square sequences are the ge...The well-known binary Legendre sequences possess good autocorrelation functions and high linear complexity, and are just special cases of much larger families of cyclotomic sequences. Prime-square sequences are the generalization of these Legendre sequences, but the ratio of the linear complexity to the least period of these sequences approximates to zero if the prime is infinite. However, a relatively straightforward modification can radically improve this situation. The structure and properties, including linear complexity, minimal polynomial, and autocorrelation function, of these modified prime-square sequences are investigated. The hardware implementation is also considered.展开更多
Let p =ef +1 be an odd prime with positive integers e and f. In this paper, we calculate the values of Gauss periods of order e =3, 4, 6 over a finite field GF(q), where q is a prime with q≠p. As applications, severa...Let p =ef +1 be an odd prime with positive integers e and f. In this paper, we calculate the values of Gauss periods of order e =3, 4, 6 over a finite field GF(q), where q is a prime with q≠p. As applications, several cyclotomic sequences of order e =3, 4, 6 are employed to construct a number of classes of cyclic codes over GF(q) with prime length. Under certain conditions, the linear complexity and reciprocal minimal polynomials of cyclotomic sequences are calculated, and the lower bounds on the minimum distances of these cyclic codes are obtained.展开更多
<div style="text-align:justify;"> <span style="font-family:Verdana;">In this paper using elementary Galois Theory, we give a detailed explanation of the calculation of the radical expre...<div style="text-align:justify;"> <span style="font-family:Verdana;">In this paper using elementary Galois Theory, we give a detailed explanation of the calculation of the radical expression for <img alt="" src="Edit_fd040e3d-ec1e-440c-a4c5-89b6c55a4a78.png" />which was first discussed by Vandermonde decades before Galois and we point out and correct a minor correction in his work which was also observed by Lagrange.</span> </div>展开更多
基金supported by the National Natural Science Foundation of China (Nos.61272492,61103231,61202492,61202395,61462077,and 61562077)the Program for New Century Excellent Talents in University (No.NCET-12-0620)
文摘Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. Let p, q, and r be distinct odd primes with gcd（p-1, q-1 ）=gcd（p- 1, r-1）=gcd（q-1, r-1）=2. In this paper, a new class of generalized cyclotomic sequence with respect to pqr over GF（2） is constructed by finding a special characteristic set. In addition, we determine its linear complexity using cyclotomic theory. Our results show that these sequences have high linear complexity, which means they can resist linear attacks.
基金supported by the National Natural Science Foundation of China (61102093)the Joint Funds of the National Natural Science Foundation of China (U1304604)the Fujian Normal University Innovative Research Team (IRTL 1207)
文摘Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.
基金This work is supported by the National Natural Science Foundation of China(Grant No.60473028)The research of the second author is also supported in part by the Natural Science Foundation of Fujian Province of China (Grant No.A0540011)the Science and Technology Foundation of Putian City(Grant No.2005S04).
文摘Pseudo-random sequences are used extensively for their high speed and security level and less errors. As a branch, the cyclotomic sequences and the generalized ones are studied widely because of their simple mathematical structures and excellent pseudo-random properties. In 1998, Ding and Helleseth introduced a new generalized cyclotomy which includes the classical cyclotomy as a special case. In this paper, based on the generalized cyclotomy, new generalized cyclotomic sequences with order two and length pq are constructed. An equivalent definition of the sequences is deduced so that the autocorrelation values of these sequences can be determined conveniently. The construction contributes to the understanding of the periodic autocorrelation structure of cyclotomically-constructed binary sequences, and the autocorrelation function takes on only a few values.
文摘Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diophantine equations.
基金This work is supported by the National Natural Science Foundation of China under Grant No.60503009.
文摘The well-known binary Legendre sequences possess good autocorrelation functions and high linear complexity, and are just special cases of much larger families of cyclotomic sequences. Prime-square sequences are the generalization of these Legendre sequences, but the ratio of the linear complexity to the least period of these sequences approximates to zero if the prime is infinite. However, a relatively straightforward modification can radically improve this situation. The structure and properties, including linear complexity, minimal polynomial, and autocorrelation function, of these modified prime-square sequences are investigated. The hardware implementation is also considered.
基金Supported by the National Natural Science Foundation(NNSF)of China(No.11171150)Foundation of Science and Technology on Information Assurance Laboratory(No.KJ-13-001)+1 种基金Funding of Jiangsu Innovation Program for Graduate Education(CXLX13-127,Fundamental Research Funds for the Central Universities)Funding for Outstanding Doctoral Dissertation in NUAA(BCXJ-13-17)
文摘Let p =ef +1 be an odd prime with positive integers e and f. In this paper, we calculate the values of Gauss periods of order e =3, 4, 6 over a finite field GF(q), where q is a prime with q≠p. As applications, several cyclotomic sequences of order e =3, 4, 6 are employed to construct a number of classes of cyclic codes over GF(q) with prime length. Under certain conditions, the linear complexity and reciprocal minimal polynomials of cyclotomic sequences are calculated, and the lower bounds on the minimum distances of these cyclic codes are obtained.
文摘<div style="text-align:justify;"> <span style="font-family:Verdana;">In this paper using elementary Galois Theory, we give a detailed explanation of the calculation of the radical expression for <img alt="" src="Edit_fd040e3d-ec1e-440c-a4c5-89b6c55a4a78.png" />which was first discussed by Vandermonde decades before Galois and we point out and correct a minor correction in his work which was also observed by Lagrange.</span> </div>
