A trace representation of binary Jacobi sequences
|
|
- Scot Barnett
- 5 years ago
- Views:
Transcription
1 Discrete Mathematics ) A trace representation of binary Jacobi sequences Zongduo Dai a, Guang Gong b, Hong-Yeop Song c, a State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, , Beijing, China b Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada c School of Electrical and Electronics Engineering, Yonsei University, Seoul, Republic of Korea Received 1 February 004; received in revised form 19 February 008; accepted 19 February 008 Available online 1 April 008 Abstract We determine the trace function representation, or equivalently, the Fourier spectral sequences of binary Jacobi sequences of period pq, where p and q are two distinct odd primes. This includes the twin-prime sequences of period pp + ) whenever both p and p + are primes, corresponding to cyclic Hadamard difference sets. c 008 Elsevier B.V. All rights reserved. Keywords: Cyclic difference sets; Twin-prime cyclic difference sets; Trace representations; discrete) Fourier spectral sequence; Defining pairs; Binary sequences with two-level autocorrelation; Binary Hadamard sequences 1. Introduction We will begin by the following definition of Jacobi sequences of period pq for two distinct odd primes p and q: Definition 1. Let p, q be two distinct odd primes. We define a binary sequence J p,q = {J p,q t) t 0} of period pq as 0 t 0mod pq) 1 t 0mod p), t 0mod q) J p,q t) = 0 t 0mod p), t 0mod q) σ tp ) tq ) 1) ) t, pq) = 1, where σ 1) = 0 and σ 1) = 1, and p t ) is the Legendre symbol of the integer t mod p, taking the value +1 or 1 according to whether t is a quadratic residue mod p or not. It is clear that σ t p ) t q )) = σ t p ) + σ t q ). To study the characteristic sequence of cyclic difference sets mod p p + ) which has been called twin-prime cyclic Hadamard difference sets [1,9]) whenever both p and p + are prime, Kim and Song [13] have generalized the definition of the characteristic sequences into the cases with sequences of period pq where both p and q are Part of this paper has been presented in 003 IEEE International Symposium on Information Theory, Yokohama, Japan. Corresponding author. addresses: yangdai@public.bta.net.cn Z. Dai), ggong@calliope.uwaterloo.ca G. Gong), hysong@yonsei.ac.kr H.-Y. Song) X/$ - see front matter c 008 Elsevier B.V. All rights reserved. doi: /j.disc
2 1518 Z. Dai et al. / Discrete Mathematics ) two odd primes. The minimal polynomial of these sequences was obtained in [5]. From the well-known result, the trace representation of a Jacobi sequence can be given by i Trρi)xi ) where ρi) F n n will be defined later), i is a coset leader modulo N = pq, and summution is taken over a set consisting of coset leaders modulo N for which ρi) 0 see [17], Exercise 8.41). The trace representation can be computed by applying the discrete) Fourier transform []. {ρi)} is referred to as a Fourier) spectral sequence. In general, from the minimal polynomial of a sequence, it is not easy to determine the spectral sequence {ρi)}. In this paper, we will determine the trace representation of Jacobi sequences of period pq, i.e., the spectral sequence {ρi)}. As an easy consequence, we determine the linear complexity of the sequence which was obtained earlier [5,13]. The result in this paper makes use of the results in both [14,4]. Section reviews the trace representation of quadratic residue sequences of period p. Section 3 gives the main result with a proof. Section 4 concludes this paper.. Preparation Let s = {st) t 0} be a binary sequence of period N that divides n 1 for some n. Then, it is known [17,,10] that there exists a primitive N-th root γ of unity and a polynomial gx) = 0 i<n ρi)xi mod x N 1) such that st) = gγ t ) t = 0, 1,,.... We call the pair gx), γ ) a defining pair of the sequence s [4]. In the remainder of this paper, we will consider only the case where N is either an odd prime or a product of two distinct odd primes. The relation between the sequence s = {st) t 0} and its spectral counterpart {ρi) i 0} is given as st) = ρi)γ it ρi) = st)γ it. ) 0 i<n 0 t<n The RHS of ) is referred to as the discrete) Fourier transform of s, and the LHS of ), its inverse formula. The main result of this paper is to determine the spectral sequence{ρi)}, or equivalently the defining pair gx), γ ), when s is a Jacobi sequence. Let p be an odd prime, and F p be the finite field with p elements. We denote by Fp the cyclic multiplicative group F p \ {0}. It is well known that Fp is a disjoint union of A 0 {x x Fp } and A 1 Fp \ A 0 of equal size p 1)/. It is also well known that A 0 is a cyclic difference set with parameters v = p, k = p 1)/, λ = p 3)/4) [1,4, 9,11,1,14]. In the remainder of this paper, we let A 0 x) = x t mod x p 1), t A 0 and A 1 x) = t A 1 x t = t F p \A 0 x t mod x p 1), which are called the generating polynomials of A 0 and A 1, respectively. Let where Ax) = p 1 a 0, a 1 ) = + a 0 A 0 x) + a 1 A 1 x) mod x p 1), 3) { 1, 0) if p ±1mod 8) ω, ω ) if p ±3mod 8), and ω F 4 \ F is a chosen primitive 3-rd root of unity. It is known [4] that one can always find a primitive p-th root α of unity such that 1 p +1mod 8) 0 p 1mod 8) A 0 α) = ω 4) p +3mod 8) ω p 3mod 8).
3 Z. Dai et al. / Discrete Mathematics ) For this choice of α, we have that A 1 α) = 0, 1, ω, ω for p +1, 1, +3, 3mod 8), respectively [4]. With Ax) in 3) and α defined above, we have the following basic lemma. Lemma Basic Lemma [4]). Let p be an odd prime, α be chosen by 4), and Ax) be as given in 3). Let b p = {b p t) t 0} be the sequence of period p defined as { 1 t A0, b p t) = 0 t F p \ A 0. Then, Ax), α) is a defining pair of the sequence b p. For the sake of convenience, for any other odd prime q, we let Bx) = q 1 + b 0 B 0 x) + b 1 B 1 x) mod x q 1), 5) where B i x) is the generating polynomial of the set B i for i = 0, 1, B 0 is the set of quadratic residues mod q, B 1 is the set of quadratic non-residues mod q, and { 1, 0) if q ±1mod 8) b 0, b 1 ) = ω, ω ) if q ±3mod 8). Let b q = {b q t) t 0} be the sequence of period q defined as { 1 t B0, b q t) = 0 t F p \ B 0. Then, from Lemma, one can find a primitive q-th root β of unity such that Bx), β) is a defining pair of b q. It is the choice that gives 1 p +1mod 8) 0 p 1mod 8) B 0 α) = ω 6) p +3mod 8) ω p 3mod 8). In the remainder of this paper, we keep the notations A i x), B i x), Ax), Bx), which can be regarded as polynomials over some extension of F, and the choice ω, α and β. Also in the following, we let e p and e q be integers mod pq such that e p = { 1mod p) 0mod q), and e q = { 1mod q) 0mod p). Note that e p and e q are unique mod pq due to the Chinese Remainder Theorem [6]. 3. Main result We let Tr n 1 x) = 0 i<n xi be the trace [17] of x from F n to F. Modulo 8, the odd primes p and q have 4 difference values, and there are 16 different cases for the pair p, q). In the following, we group 8 of them together, and distinguish only two cases as follows: CASE 1: p, q) {+1, +1), +1, 1), 1, +1), 1, 1), +3, +3), +3, 3), 3, +3), 3, 3)}; and CASE : p, q) {+1, +3), +1, 3), 1, +3), 1, 3), +3, +1), +3, 1), 3, +1), 3, 1)}. This section is entirely devoted to the proof of the main theorem given as follows: Theorem 3 Main Theorem). For any two distinct odd primes p and q, there exist α, β and ω which satisfy the conditions 4) and 6), respectively, where α is a p-th primitive root of unity, β is a q-th primitive root of unity
4 150 Z. Dai et al. / Discrete Mathematics ) and ω is a 3-rd primitive root of unity. Recall the choice of all the notations discussed so far. Define a polynomial Jx)mod x pq 1) as follows: Jx) = q 1 x epi + p + 1 x e q j A i x e p )B i x e q ) for CASE 1, and + ω A i x e p )B i x e q ) + ω A i x e p )B i+1 x e q ) for CASE, where B x) = B 0 x). Then, i) the Jacobi sequence J p,q = {J p,q t) t 0} in Definition 1 has a defining pair Jx), αβ), and ii) it has a trace representation as follows: J p,q t) = q 1 Tr m 1 αui t ) + p + 1 Tr n 1 βv j t ) 0 i<c p 0 j<c q α ui β v j ) t) for CASE 1, and + i j mod ) i j mod ) ωα ui β v j ) t) + i j mod ) ω α ui β v j ) t) for CASE, where m and n are orders of mod p and q, respectively, c p = p 1 m, c q = q 1 n, d = m, n) is the gcd of m and n, M = mn/d, and finally, u and v are any given generators of Fp and F q, respectively. Before we start the proof of the main theorem, we observe the following see [5,13]): Remark 4. The linear complexity L SJ p,q ) of J p,q is given from the main theorem as follows: { p 1)q 1) L SJ p,q ) = p 1)ɛ q 1 ) + q 1)ɛ p + 1 CASE 1, ) + p 1)q 1) CASE, where ɛa) = 1, 0 for a 1, 0mod ), respectively. Now, we begin the proof of the main theorem. Definition 5. Let T be an odd integer. A δ-sequence of period T, which will be denoted by δ T = {δ T t) t 0}, is defined as { 1 t 0mod T ) δ T t) = 0 otherwise. We also define T x) = 0 i<t x i. It is clear that T x), γ ) is a defining pair of the δ-sequence δ T, where γ is any given T -th primitive root of unity. Definition 6. Given a sequence s = {st) t 0}, the λ-jump sequence of s, which will be denoted by s [λ] = {s [λ] t) t 0}, is defined as { s [λ] st) t 0 mod λ) t) = 0 otherwise.
5 Z. Dai et al. / Discrete Mathematics ) Table 1 Proof of Lemma 7 Sequences t 0pq) t 0p) t 0q) t, pq) = 1 t 0p) t 0q) )) )) b p 0 0 σ tp σ tp )) )) b q 0 σ tq 0 σ tq b [q] )) p 0 0 σ tp 0 b q [p] )) 0 σ tq 0 0 δ p δ pq ) )) SUM = J p,q σ tp tq Table Defining pair of each component sequence in Lemma 8 Sequences b p b q b [q] p b q [p] δ p δ pq Defining pair Ax ep ), αβ) Bx eq ), αβ) Ax ep ) q x eq ), αβ) Bx eq ) p x ep ), αβ) p x ep ), αβ) pq x), αβ) It is clear that the λ-jump sequence of s is obtained by multiplying s by δ λ term-by-term. That is, s [λ] t) = st)δ λ t), t. 7) Lemma 7. J p,q = b p + b q + b [q] p + b [p] q + δ p + δ pq. Proof. It is straightforward to check. See Table 1. Lemma 8. The defining pairs of six component sequences of J p,q in Lemma 7 are given in Table. Proof. Note that αβ) e p = α, αβ) e q = β. Now, it is straightforward to check the following: Aαβ) e pt ) = Aα t ) = b p t), t. Bαβ) e q t ) = Bβ t ) = b q t), t. Aαβ) e pt ) q αβ) e q t ) = Aα t ) q β t ) = b p t)δ q t) = b [q] p t), Bαβ) e q t ) p αβ) e pt ) = Bβ t ) p α t ) = b q t)δ p t) = b [p] q t), t, where, we use the relation in 7). The remaining two cases can be done similarly. t, Lemma 9. If f x) gx)mod x p 1) then f x e p ) gx e p )mod x pq 1).
6 15 Z. Dai et al. / Discrete Mathematics ) Proof. f x) gx)mod x p 1) f x) gx) = x p 1)hx) for some hx) f x e p ) gx e p ) = x pe p 1)hx e p ). Since pe p 0mod pq), we get f x e p) gx e p) 0mod x pq 1). Lemma 10. The three identities in the following are true: i) pq x) = 1 + x epi + x e q j + x e pi+e q j mod x pq 1), ii) iii) x e pi = A 0 x e p ) + A 1 x e p )mod x pq 1), x e q j+e p i = A i x e p )B j x e q )mod x pq 1). Proof. The identity i) comes from the following: Note that {imod pq) 0 i < pq} = {e p i + e q j mod pq) 0 i < p, 0 j < q} = {0} {e p imod pq) 1 i < p} {e q j mod pq) 1 j < q} {e p i + e q j mod pq) 1 i < p, 1 j < q}. x i = x i = x i = A 0 x) + A 1 x)mod x p 1). i A 0 A 1 i F p Now, the assertion ii) follows from Lemma 9. For iii), observe the following: ) ) x e pi+e q j = = x e pi = A i x e p ) x e q j B j x e q ) A i x e p )B j x e q )mod x pq 1), where we use the above identity ii) in the second equality. Lemma 11. Let J p,q x) = q 1 x e pi + p + 1 x e q j + a i + b j + 1)A i x e p )B j x e q )mod x pq 1), where a i, b j, A i x), B j x) are defined for b p and b q in the previous section. Then, J p,q x), αβ) is a defining pair of J p,q. Proof. Lemmas 7 and 8 imply that J p,q has a defining pair gx), αβ), where gx) = Ax e p ) + Bx e q ) + Ax e p ) q x e q ) + Bx e q ) p x e p ) + p x e p ) + pq x)mod x pq 1).
7 Therefore, Lemma 10 implies that Z. Dai et al. / Discrete Mathematics ) gx) = Ax e p )1 + q x e q )) + Bx e q )1 + p x e p )) + p x e p ) + pq x) p 1 = + ) a i A i x e p ) x e q j q ) b i B i x e q ) x epi x e pi x epi + x e q j + A i x e p )B j x e q )mod x pq 1), which can be re-organized to equal to J p,q x)mod x pq 1). Now, consider the proof of the item i) of the main theorem. We have shown that J p,q x) in Lemma 11 and αβ form a defining pair of the Jacobi sequence. Therefore, we need to show that the last term of J p,q x) in Lemma 11 is the same as the last term of Jx) in the main theorem. This can easily be done by recalling the definition of a i, b j in the previous section. That is, when p, q) = ±1, ±1)mod 8), for example, a 0, a 1 ) = b 0, b 1 ) = 1, 0) and hence, the last term of J p,q x) in Lemma 11 becomes A 0 x e p)b 0 x e q ) + A 1 x e p)b 1 x e q ). The remaining cases can similarly be checked. For the item ii) of the main theorem, we consider the set of all the primitive pq-th roots of unity. It is well-known that there are p 1)q 1) primitive pq-th roots of unity in the algebraic closure of F, all of them are sitting in F M, and it is also known that they are partitioned into p 1)q 1)/M conjugacy classes over F, where M = mn/d, d = m, n). We need the following lemma which gives a complete set S of representatives of these conjugacy classes. Lemma 1. A complete set S of representatives of conjugacy classes of the p 1)q 1) primitive pq-th roots of unity over F is given as: S = {α ui β v j 0 i < c p, 0 j < c q d}. Proof. Note that S = c p c q d = p 1)q 1)/M. Therefore, it is enough to show that any two elements in S are not conjugate of each other. Suppose there are two elements in S which are conjugate of each other. Then, there exist i, j) k, l) with 0 i, k < c p and 0 j, l < c q d such that α ui β v j S, α uk β vl S, and α ui β v j ) t = α uk β vl. This implies α ui t u k = β vl v j t α β = 1, where α is the cyclic subgroup generated by α. Therefore, we have { u i t u k mod p) v l v j t mod q). Note that u c p = is a subgroup of F p, and that vc q = is a subgroup of F q. Therefore, λ s.t. λ, m) = 1 and u c pλ mod p), µ s.t.µ, n) = 1 and v c qµ mod q). Therefore, { u c p λt u k i mod p) 8) v cqµt v l j mod q) { cp λt k i mod p 1) c q µt l j mod q 1) 8) 9)
8 154 Z. Dai et al. / Discrete Mathematics ) { cp k i c q l j { k i = cp z p for some z p l j = c q z q for some z q. Note that we have assumed 0 k < c p and 0 i < c p. Therefore, 10) implies k = i. Therefore, 9) c p λt 0 mod p 1) λt 0 mod m) since c p = p 1)/m, t 0 mod m) since λ, m) = 1. Assume that, for some τ, Then, t = mτ. 9) and 11) c q µt l j c q z q mod q 1) µt z q mod n) µmτ z q mod n) 10) 11) 1) 13) d = m, n) z q c q d c q z q = l j. Note that we have assumed 0 l < c q d and 0 j < c q d. Therefore, the above c q d l j implies j = l. Therefore i, j) = k, l), which is a contradiction. Now, we are ready for the item ii) of the main theorem. For the first term in the trace representation, note that u c p = is a subgroup of Fp, and hence, Fp = u i u c p = u i. 0 i<c p 0 i<c p Therefore, x i = j F p = x j = 0 i<c p Tr m 1 Lemma 9 now implies that x epi = Tr m 1 0 i<c p cp 1 j i=0 u i x j = x ui ) mod x p 1). c p 1 m 1 x ui k i=0 k=0 x e pu i ) mod x pq 1).
9 Z. Dai et al. / Discrete Mathematics ) Substituting x = αβ) t into the above gives x e pi ) Tr m 1 α ui t. 14) 0 i<c p x=αβ) t = Similarly, using the fact that v c q = is a subgroup of Fq, we get the second term as x e q j ) Tr n 1 β v j t. 15) 0 j<c q x=αβ) t = For the third term, recall the notation of A i, B j and their generating polynomials A i x), B j x), respectively. a i + b j + 1)A i x e p )B j x e q ) = a i + b j + 1) x e pt x e q s t A i s B j where we use the notation ρ i, j a j + b j + 1, = a i + b j + 1) t Ai = a i + b j + 1) = 0 t 1 <p 1)/ 0 s 1 <q 1)/ = e x p t+e q s s B j 0 t 1 <p 1)/ 0 s 1 <q 1)/ x e pu i+t 1 +e q v j+s 1 a i + b j + 1)x e pu i+t 1 +e q v j+s 1 ρ i, j x e pu i +e q v j ζx)mod x pq 1), where the subscripts i and j are understood mod. Recall that a 0, a 1 ) = 1, 0) or ω, ω ) if p ±1 or ±3, respectively, and similarly for b 0, b 1 ). Therefore, when p, q) = ±1, ±1) or ±3, ±3), i.e., in CASE 1, we have { 1 i j mod ) ρ i, j = 0 i j mod ). For CASE, on the other hand, we have { ω i j mod ) ρ i, j = ω i j mod ). Now, consider CASE 1, first. Then, ζx) = x e pu i +e q v j mod x pq 1). i j mod ) Substituting x = αβ) t into ζx) gives the following: ζαβ) t ) = αβ) te pu i +e q v j ) = α ui β v j ) t i j mod ) = i j mod ) i j mod ) α ui β v j ) t), 16)
10 156 Z. Dai et al. / Discrete Mathematics ) where the last equality comes from Lemma 1. For CASE, ζx) = ωx e pu i +e q v j + ω x e pu i +e q v j mod x pq 1). i j mod ) i j mod ) Similarly, substituting x = αβ) t into ζx) and using Lemma 1 gives the following: ζαβ) t ) = ωα ui β v j ) t) + ω α ui β v j ) t). 17) i j mod ) i j mod ) The item ii) of the main theorem now follows from 14) 17), and this finishes the proof of the main theorem. Example 13. The smallest example would be p, q) = 3, 5), and this turns out to be the same as the binary m- sequence of period 15. The next is p, q) = 3, 7), but this case does not correspond to any cyclic difference set. Therefore, we consider the case p, q) = 5, 7) which gives a binary sequence J p,q = {st)} t 0 of period 35 with the ideal two-level autocorrelation. Now we consider J 5,7 = {st)} t 0. Keeping the notations in the Main Theorem, it is clear that p, q) = 5, 7) belongs to the CASE, and that A 0 = {1, 4}, A 1 = {, 3}, m = 4, c 5 = 1, e 5 = 1, B 0 = {1,, 4}, B 1 = {3, 5, 6}, n = 3, c 7 =, e 7 = 15, d = 1, M = 1, and that A 0 x) = x + x 4 A 1 x) = x + x 3 B 0 x) = x + x + x 4 B 1 x) = x 3 + x 5 + x 6. According to the Main Theorem, we may take u = and v = 3, since and 3 are generators of F 5 and F 7, respectively. Note that 5 = 3mod 8), 7 = 1mod 8), it belongs to the CASE. It is known that there exists a 5-th primitive root α of unity such that A 0 α) = ω, where ω is a 3-rd primitive root of unity, and there exists a 7-th primitive root of unity β such that B 0 α) = 0. With such choices of α, ω and β, based on Main Theorem we get the following: Fact: Keep the notations in the Main Theorem. Let α be a 5-th primitive root α of unity such that A 0 α) = ω, where ω is a 3-rd primitive root of unity, and let β be a 7-th primitive root of unity β such that B 0 α) = 0. Then the Jacobi sequence J 5,7 has a defining pair Jx), αβ) with Jx) = x 1i + x 15 j + ω A i x 1 )B i x 15 ) + ω A i x 1 )B i+1 x 15 ), 1 i<5 and a trace representation as st) = Tr j<7 α t ) + Tr 3 1 β t + β 3t) + Tr 1 1 ωαβ) t + ω αβ 3 ) t), t. Next we show how to get the right elements α, ω and β. In order to choose the right α and ω, we start from a 5-th primitive root θ of unity, which must be a root of the irreducible polynomial x 4 + x 3 + x + x + 1 over F, hence, T r1 4θ) = 1. Let δ = A 0θ), it is clear that δ = A 0 θ) = θ + θ 4 = T r 4 θ), and then that 1 = T r1 4θ) = T r 1 T r 4θ)) = T r 1 δ), which leads to the fact that δ F \ F, hence, δ is a 3-rd primitive root of unity. Thus, ω = δ and α = θ are the right choices. Similarly, in order to choose a right β, we start from a 7-th primitive root θ of unity, say, θ is a root of the primitive polynomial x 3 + x + 1 of degree 3 over F. It is clear that B 0 θ) = θ + θ + θ 4 = θ + θ + θ1 + θ) = 0. Thus, β = θ is a right choice.
11 Z. Dai et al. / Discrete Mathematics ) Concluding remarks The characteristic sequences of v, v 1)/, v 3)/4)-cyclic Hadamard difference sets [1,9,10,1,0,4] are known to have the ideal two-level autocorrelation function, and they have been studied in the community of communications engineering and cryptography. Every known cyclic Hadamard difference set has the value v which is either i) a prime congruent to 3mod 4), ii) a product of twin primes, or iii) of the form m 1 for some integer m [1,8,1,0]. Family iii) have been intensively studied for a long time and their linear complexity and trace representations are now well understood except possibly for the newly discovered hyperoval constructions [16,3,7]. Recently, in a series of publications, trace representations for the family i) have been completed [18,19,14,15,4]. This paper determined a trace representation for the family ii). Acknowledgements Zongduo Dai and Hong-Yeop Song wish to acknowledge Prof. Guang Gong of University of Waterloo who invited them to visit University of Waterloo from July 1 to August 30, 00, and from Jan. 17 to Feb. 7, 004, respectively. Zongduo Dai s work was supported by National Natural Science Foundation of CHINA Grant No ), and the National 973 Project Grant No ), Guang Gong s work is supported by NSERC, CANADA, and Hong-Yeop Song s work was supported by the grant R ) from the Basic Research Program of the Korea Science & Engineering Foundation, KOREA. References [1] L.D. Baumert, Cyclic Difference Sets, in: Lecture Notes in Mathematics, vol. 18, Springer-Verlag, New York, [] R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, Reading MA, [3] A. Chang, S.W. Golomb, G. Gong, P.V. Kumar, On ideal autocorrelation sequences arising from hyperovals, in: C. Ding, T. Helleseth, H. Niederreiter Eds.), Sequences and Their Applications, Proceedings of SETA98, Springer, New York, 1999, pp [4] Z. Dai, G. Gong, H.-Y. Song, Trace representation and linear complexity of binary e-th residue sequences, WCC 003, in: International Workshop on Coding and Cryptography, Versailles, France, March 4 8, 003. [5] C. Ding, Linear complexity of generalized cyclotomic binary sequences of order, Finite Fields Appl. 3 ) 1997) [6] C. Ding, D. Pei, A. Salomaa, Chinese Remainder Theorem: Applications in Computing, Coding and Cryptography, World Scientific, Singapore, [7] R. Evans, H. Hollmann, C. Krattenthaler, Q. Xiang, Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets, J. Combin. Theory, Ser. A ) [8] S.W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, CA, 1967, Revised edition, Aegean Park Press, Laguna Hills, CA, 198. [9] S.W. Golomb, Construction of signals with favourable correlation properties, in: A.D. Keedwell Ed.), Survey in Combinatorics, in: LMS Lecture Note Series, vol. 166, Cambridge University Press, 1991, pp [10] S.W. Golomb, G. Gong, Signal Designs with Good Correlation: For Wireless Communications, Cryptography and Radar Applications, Cambridge University Press, 005. [11] D. Jungnickel, Difference sets, in: J.H. Dinitz, D.R. Stinson Eds.), Contemporary Design Theory, John Wiley & Sons, Inc, New York, 199, pp [1] J.-H. Kim, H.-Y. Song, Existence of cyclic hadamard difference sets and its relation to binary sequences with ideal autocorrelation, J. Commun. Networks 1 1) 1999) [13] J.-H. Kim, M. Shin, H.-Y. Song, Linear complexity of Jacobi sequences, pre-print, [14] J.-H. Kim, H.-Y. Song, Trace representation of legendre sequences, Des. Codes Cryptogr. 4 3) 001) [15] J.-H. Kim, H.-Y. Song, G. Gong, Trace Function Representation of Hall s Sextic Residue Sequences of Period p 7mod 8), in: J.-S. No, H.-Y. Song, T. Helleseth, V. Kumar Eds.), Mathematical Properties of Sequences and Other Combinatorial Structures, Kluwer Academic Publishing, New York, 003. [16] A. Maschietti, Difference sets and hyperovals, Des. Codes Cryptogr ) [17] R. Lidl, H. Niederreiter, Finite Fields, in: Encyclopedia of Mathematics and its Applications, vol. 0, Addison-Wesley, 1983 Chapter 8) Revised version, Cambridge University Press, 1997). [18] J.-S. No, H.-K. Lee, H. Chung, H.-Y. Song, K. Yang, Trace representation of legendre sequences of Mersenne prime period, IEEE Trans. Inform. Theory 4 6) 1996) [19] H.-K. Lee, J.-S. No, H. Chung, K. Yang, J.-H. Kim, H.-Y. Song, Trace function representation of Hall s sextic residue sequences and some new sequences with ideal autocorrelation, in: Proceedings of APCC 97, APCC, Dec. 1997, pp [0] H.-Y. Song, S.W. Golomb, On the existence of cyclic Hadamard difference sets, IEEE Trans. Inform. Theory 40 4) 1994) [1] R.G. Stanton, D.A. Sprott, A family of difference sets, Canad. Jour. Math )
Trace Representation of Legendre Sequences
C Designs, Codes and Cryptography, 24, 343 348, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Trace Representation of Legendre Sequences JEONG-HEON KIM School of Electrical and
More informationhas the two-level autocorrelation function for (2) otherwise, where the periodic unnormalized autocorrelation function of the sequence is defined as
1530 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 3, MARCH 2011 Trace Representation Linear Complexity of Binary eth Power Residue Sequences of Period p Zongduo Dai, Guang Gong, Hong-Yeop Song,
More informationExistence of Cyclic Hadamard Difference Sets and its Relation to Binary Sequences with Ideal Autocorrelation
14 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL.1, NO.1, MARCH 1999 Existence of Cyclic Hadamard Difference Sets and its Relation to Binary Sequences with Ideal Autocorrelation Jeong-Heon Kim and Hong-Yeop
More informationFour classes of permutation polynomials of F 2 m
Finite Fields and Their Applications 1 2007) 869 876 http://www.elsevier.com/locate/ffa Four classes of permutation polynomials of F 2 m Jin Yuan,1, Cunsheng Ding 1 Department of Computer Science, The
More informationSinger and GMW constructions (or generalized GMW constructions), little else is known about p-ary two-level autocorrelation sequences. Recently, a few
New Families of Ideal -level Autocorrelation Ternary Sequences From Second Order DHT Michael Ludkovski 1 and Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo,
More informationAlmost Difference Sets and Their Sequences With Optimal Autocorrelation
2934 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 7, NOVEMBER 2001 Almost Difference Sets Their Sequences With Optimal Autocorrelation K. T. Arasu, Cunsheng Ding, Member, IEEE, Tor Helleseth,
More informationMinimal polynomials of the modified de Bruijn sequences
Discrete Applied Mathematics 156 (2008) 1549 1553 www.elsevier.com/locate/dam Minimal polynomials of the modified de Bruijn sequences Gohar M. Kyureghyan Department of Mathematics, Otto-von-Guericke University
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA September 2008 Outline of this talk Difference sets and almost difference sets Cyclotomic classes Introduction of binary sequences with optimal autocorrelation
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA July 2004 The Autocorrelation Function The autocorrelation of a binary sequence {s(t)} of period N at shift w is C s (w) = ( 1) s(t+w) s(t). N 1 t=0 The
More informationConstructions of Quadratic Bent Functions in Polynomial Forms
1 Constructions of Quadratic Bent Functions in Polynomial Forms Nam Yul Yu and Guang Gong Member IEEE Department of Electrical and Computer Engineering University of Waterloo CANADA Abstract In this correspondence
More informationCorrelation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields
Correlation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields Zilong Wang and Guang Gong Department of Electrical and Computer Engineering, University of Waterloo Waterloo,
More informationOn the Linear Complexity of Legendre-Sidelnikov Sequences
On the Linear Complexity of Legendre-Sidelnikov Sequences Ming Su Nankai University, China Emerging Applications of Finite Fields, Linz, Dec. 12 Outline Motivation Legendre-Sidelnikov Sequence Definition
More informationDifference Systems of Sets and Cyclotomy
Difference Systems of Sets and Cyclotomy Yukiyasu Mutoh a,1 a Graduate School of Information Science, Nagoya University, Nagoya, Aichi 464-8601, Japan, yukiyasu@jim.math.cm.is.nagoya-u.ac.jp Vladimir D.
More informationHadamard ideals and Hadamard matrices with two circulant cores
Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,
More informationAffine equivalence in the AES round function
Discrete Applied Mathematics 148 (2005) 161 170 www.elsevier.com/locate/dam Affine equivalence in the AES round function A.M. Youssef a, S.E. Tavares b a Concordia Institute for Information Systems Engineering,
More informationOn the Cross-Correlation of a p-ary m-sequence of Period p 2m 1 and Its Decimated
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 3, MARCH 01 1873 On the Cross-Correlation of a p-ary m-sequence of Period p m 1 Its Decimated Sequences by (p m +1) =(p +1) Sung-Tai Choi, Taehyung Lim,
More informationNew Ternary and Quaternary Sequences with Two-Level Autocorrelation
New Ternary and Quaternary Sequences with Two-Level Autocorrelation Honggang Hu Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1, Canada Email. h7hu@uwaterloo.ca
More informationOn the p-ranks and Characteristic Polynomials of Cyclic Difference Sets
Designs, Codes and Cryptography, 33, 23 37, 2004 # 2004 Kluwer Academic Publishers. Manufactured in The Netherlands. On the p-ranks and Characteristic Polynomials of Cyclic Difference Sets JONG-SEON NO
More informationA New Characterization of Semi-bent and Bent Functions on Finite Fields
A New Characterization of Semi-bent and Bent Functions on Finite Fields Khoongming Khoo DSO National Laboratories 20 Science Park Dr S118230, Singapore email: kkhoongm@dso.org.sg Guang Gong Department
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationOn the Binary Sequences of Period 2047 with Ideal Autocorrelation Seok-Yong Jin
On the Binary Sequences of Period 2047 with Ideal Autocorrelation Seok-Yong Jin The Graduate School Yonsei University Department of Electrical and Electronic Engineering On the Binary Sequences of Period
More informationBinary Sequence Pairs with Ideal Correlation and Cyclic Difference Pairs
Binary Sequence Pairs with Ideal Correlation and Cyclic Difference Pairs Seok-Yong Jin The Graduate School Yonsei University Department of Electrical and Electronic Engineering Binary Sequence Pairs with
More informationOn the existence of cyclic difference sets with small parameters
Fields Institute Communications Volume 00, 0000 On the existence of cyclic difference sets with small parameters Leonard D. Baumert 325 Acero Place Arroyo Grande, CA 93420 Daniel M. Gordon IDA Center for
More informationOn Welch-Gong Transformation Sequence Generators
On Welch-Gong Transformation Sequence Generators G. Gong and A.M. Youssef Center for Applied Cryptographic Research, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario
More informationHyperbent functions, Kloosterman sums and Dickson polynomials
Hyperbent functions, Kloosterman sums and Dickson polynomials Pascale Charpin INRIA, Codes Domaine de Voluceau-Rocquencourt BP 105-78153, Le Chesnay France Email: pascale.charpin@inria.fr Guang Gong Department
More informationBinary Additive Counter Stream Ciphers
Number Theory and Related Area ALM 27, pp. 1 23 c Higher Education Press and International Press Beijing Boston Binary Additive Counter Stream Ciphers Cunsheng Ding, Wenpei Si Abstract Although a number
More informationConstructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice
Noname manuscript No. (will be inserted by the editor) Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice Chunming Tang Yanfeng Qi Received: date
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationDiscrete Applied Mathematics 105 (2000) On (n; k)-sequences. Received 7 April 1999; revised 21 December 1999; accepted 22 December 1999
Discrete Applied Mathematics 105 (2000) 183 192 On (n; k)-sequences Hong-Yeop Song a;, June Bok Lee b a Department of Electrical and Computer Engineering, Yonsei University, Seoul 120-749, South Korea
More informationOn the Complexity of the Dual Bases of the Gaussian Normal Bases
Algebra Colloquium 22 (Spec ) (205) 909 922 DOI: 0.42/S00538675000760 Algebra Colloquium c 205 AMSS CAS & SUZHOU UNIV On the Complexity of the Dual Bases of the Gaussian Normal Bases Algebra Colloq. 205.22:909-922.
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More informationStatistical Properties of the Arithmetic Correlation of Sequences. Mark Goresky School of Mathematics Institute for Advanced Study
International Journal of Foundations of Computer Science c World Scientific Publishing Company Statistical Properties of the Arithmetic Correlation of Sequences Mark Goresky School of Mathematics Institute
More informationNew quaternary sequences of even length with optimal auto-correlation
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2018, Vol. 61 022308:1 022308:13 doi: 10.1007/s11432-016-9087-2 New quaternary sequences of even length with optimal auto-correlation Wei SU
More informationExplicit classes of permutation polynomials of F 3
Science in China Series A: Mathematics Apr., 2009, Vol. 53, No. 4, 639 647 www.scichina.com math.scichina.com www.springerlink.com Explicit classes of permutation polynomials of F 3 3m DING CunSheng 1,XIANGQing
More informationCOMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125
COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125 ROBERT S. COULTER AND PAMELA KOSICK Abstract. This note summarises a recent search for commutative semifields of order 243 and 3125. For each of these two orders,
More informationA New Class of Bent Negabent Boolean Functions
A New Class of Bent Negabent Boolean Functions Sugata Gangopadhyay and Ankita Chaturvedi Department of Mathematics, Indian Institute of Technology Roorkee Roorkee 247667 INDIA, {gsugata, ankitac17}@gmail.com
More informationDisjoint difference families from Galois rings
Disjoint difference families from Galois rings Koji Momihara Faculty of Education Kumamoto University 2-40-1 Kurokami, Kumamoto 860-8555, Japan momihara@educ.kumamoto-u.ac.jp Submitted: Mar 11, 2016; Accepted:
More informationMultiplicative Order of Gauss Periods
Multiplicative Order of Gauss Periods Omran Ahmadi Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, M5S 3G4, Canada oahmadid@comm.utoronto.ca Igor E. Shparlinski
More informationComplete characterization of generalized bent and 2 k -bent Boolean functions
Complete characterization of generalized bent and k -bent Boolean functions Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng 1 Abstract In this paper we investigate properties of generalized bent Boolean
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationDecomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
More informationSequences, DFT and Resistance against Fast Algebraic Attacks
Sequences, DFT and Resistance against Fast Algebraic Attacks Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1, CANADA Email. ggong@calliope.uwaterloo.ca
More informationOn Binary Cyclic Codes with Codewords of Weight Three and Binary Sequences with the Trinomial Property
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 1, JANUARY 2001 421 [4] A. A. Davydov, Constructions and families of covering codes and saturated sets of points in projective geometry, IEEE Trans.
More informationSome Results on the Arithmetic Correlation of Sequences
Some Results on the Arithmetic Correlation of Sequences Mark Goresky Andrew Klapper Abstract In this paper we study various properties of arithmetic correlations of sequences. Arithmetic correlations are
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationInteger Valued Sequences with 2-Level Autocorrelation from Iterative Decimation Hadamard Transform
Integer Valued Sequences with 2-Level Autocorrelation from Iterative Decimation Hadamard Transform Guang Gong Department of Electrical and Computer Engineering University of Waterloo CANADA
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationThird-order nonlinearities of some biquadratic monomial Boolean functions
Noname manuscript No. (will be inserted by the editor) Third-order nonlinearities of some biquadratic monomial Boolean functions Brajesh Kumar Singh Received: April 01 / Accepted: date Abstract In this
More informationDivision of Trinomials by Pentanomials and Orthogonal Arrays
Division of Trinomials by Pentanomials and Orthogonal Arrays School of Mathematics and Statistics Carleton University daniel@math.carleton.ca Joint work with M. Dewar, L. Moura, B. Stevens and Q. Wang
More information#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS
#A3 INTEGERS 7 (27) CONFERENCE MATRICES WITH MAIMUM ECESS AND TWO-INTERSECTION SETS Koji Momihara Faculty of Education, Kumamoto University, Kurokami, Kumamoto, Japan momihara@educ.kumamoto-u.ac.jp Sho
More informationDifference Sets Corresponding to a Class of Symmetric Designs
Designs, Codes and Cryptography, 10, 223 236 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Difference Sets Corresponding to a Class of Symmetric Designs SIU LUN MA
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationGENERATION OF PRIMITIVE BINARY POLYNOMIALS
INTERNATIONAL CONFERENCE ON ALGEBRA, LOGIC AND DISCRETE MATHEMATICS April 14-16, 1995 Niš GENERATION OF PRIMITIVE BINARY POLYNOMIALS Miodrag Živković Let F q denote the finite field of order q = p n, where
More informationLarge Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences
Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Guang Gong 1 Fei Huo 1 and Yang Yang 2,3 1 Department of Electrical and Computer Engineering University of
More informationSchool of Mathematics
School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationExplicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 2007 Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields Robert W. Fitzgerald
More informationA Class of Pseudonoise Sequences over GF Correlation Zone
1644 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 b 1. The index set I must be of the form I A [ B [ C where A f1g B fz 1j z 2 C 0; z 12 C 0g and C f0z j z 2 C 1; z 12 C 1g: Observe
More informationA Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs
Journal of Combinatorial Theory, Series A 98, 118 126 (2002) doi:10.1006/jcta.2001.3231, available online at http://www.idealibrary.com on A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly
More informationEven Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions
Even Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions Yang Yang 1,2,3 Xiaohu Tang 1 and Guang Gong 2 1 Institute of Mobile Communications, Southwest Jiaotong University
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationOn one class of permutation polynomials over finite fields of characteristic two *
On one class of permutation polynomials over finite fields of characteristic two * Leonid Bassalygo, Victor A. Zinoviev To cite this version: Leonid Bassalygo, Victor A. Zinoviev. On one class of permutation
More informationTHE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1
J. Appl. Math. & Informatics Vol. 31(2013), No. 1-2, pp. 179-188 Website: http://www.kcam.biz THE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1 JI-MI YIM, SUNG-JIN CHO, HAN-DOO KIM, UN-SOOK CHOI
More informationExtended Binary Linear Codes from Legendre Sequences
Extended Binary Linear Codes from Legendre Sequences T. Aaron Gulliver and Matthew G. Parker Abstract A construction based on Legendre sequences is presented for a doubly-extended binary linear code of
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationThe Array Structure of Modified Jacobi Sequences
Journal of Mathematics Research; Vol. 6, No. 1; 2014 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education The Array Structure of Modified Jacobi Sequences Shenghua Li 1,
More informationDe Bruijn Sequences from Nonlinear Feedback Shift Registers
De Bruijn Sequences from Nonlinear Feedback Shift Registers Ming Li and Dongdai Lin State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing
More informationCyclotomic Cosets, Codes and Secret Sharing
Malaysian Journal of Mathematical Sciences 11(S) August: 59-73 (017) Special Issue: The 5th International Cryptology and Information Security Conference (New Ideas in Cryptology) MALAYSIAN JOURNAL OF MATHEMATICAL
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationFormulas for cube roots in F 3 m
Discrete Applied Mathematics 155 (2007) 260 270 www.elsevier.com/locate/dam Formulas for cube roots in F 3 m Omran Ahmadi a, Darrel Hankerson b, Alfred Menezes a a Department of Combinatorics and Optimization,
More informationSUMS OF SECOND ORDER LINEAR RECURRENCES THOMAS MCKENZIE AND SHANNON OVERBAY
SUMS OF SECOND ORDER LINEAR RECURRENCES THOMAS MCKENZIE AND SHANNON OVERBAY Abstract. This paper examines second order linear homogeneous recurrence relations with coefficients in finite rings. The first
More informationSome results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences
Some results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences A joint work with Chunlei Li, Xiangyong Zeng, and Tor Helleseth Selmer Center, University of Bergen
More informationEXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS
EXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS ROLAND B. DREIER AND KENNETH W. SMITH 1. Introduction In this paper we describe an exhaustive search for all cyclic difference sets with
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationCoding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
More informationCyclic Codes from the Two-Prime Sequences
Cunsheng Ding Department of Computer Science and Engineering The Hong Kong University of Science and Technology Kowloon, Hong Kong, CHINA May 2012 Outline of this Talk A brief introduction to cyclic codes
More informationSmall Orders of Hadamard Matrices and Base Sequences
International Mathematical Forum, Vol. 6, 2011, no. 62, 3061-3067 Small Orders of Hadamard Matrices and Base Sequences Dragomir Ž. D oković Department of Pure Mathematics and Institute for Quantum Computing
More informationConstruction X for quantum error-correcting codes
Simon Fraser University Burnaby, BC, Canada joint work with Vijaykumar Singh International Workshop on Coding and Cryptography WCC 2013 Bergen, Norway 15 April 2013 Overview Construction X is known from
More informationHyperbent functions, Kloosterman sums and Dickson polynomials
Hyperbent functions, Kloosterman sums and Dickson polynomials Pascale Charpin Guang Gong INRIA, B.P. 105, 78153 Le Chesnay Cedex, France, Pascale.Charpin@inria.fr Department of Electrical and Computer
More informationOn the Correlation Distribution of Delsarte Goethals Sequences
On the Correlation Distribution of Delsarte Goethals Seuences Kai-Uwe Schmidt 9 July 009 (revised 01 December 009) Abstract For odd integer m 3 and t = 0, 1,..., m 1, we define Family V (t) to be a set
More informationStream Ciphers and Number Theory
Stream Ciphers and Number Theory Revised Edition Thomas W. Cusick The State University of New York at Buffalo, NY, U.S.A. Cunsheng Ding The Hong Kong University of Science and Technology China Ari Renvall
More informationRelative Densities of Ramified Primes 1 in Q( pq)
International Mathematical Forum, 3, 2008, no. 8, 375-384 Relative Densities of Ramified Primes 1 in Q( pq) Michele Elia Politecnico di Torino, Italy elia@polito.it Abstract The relative densities of rational
More informationMATH 310: Homework 7
1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and
More informationA New Approach to Permutation Polynomials over Finite Fields
A New Approach to Permutation Polynomials over Finite Fields Joint work with Dr. Xiang-dong Hou and Stephen Lappano Department of Mathematics and Statistics University of South Florida Discrete Seminar
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationDifferential properties of power functions
Differential properties of power functions Céline Blondeau, Anne Canteaut and Pascale Charpin SECRET Project-Team - INRIA Paris-Rocquencourt Domaine de Voluceau - B.P. 105-8153 Le Chesnay Cedex - France
More informationHyper-bent Functions
Hyper-bent Functions Amr M. Youssef 1 and Guang Gong 2 1 Center for Applied Cryptographic Research Department of Combinatorics & Optimization University of Waterloo, Waterloo, Ontario N2L3G1, CANADA a2youssef@cacr.math.uwaterloo.ca
More informationAlgebraic Number Theory
TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More informationConstruction of Frequency Hopping Sequence Set Based upon. Generalized Cyclotomy
1 Construction of Frequency Hopping Sequence Set Based upon Generalized Cyclotomy Fang Liu, Daiyuan Peng, Zhengchun Zhou, and Xiaohu Tang Abstract: Frequency hopping (FH) sequences play a key role in frequency
More informationSECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C
p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer
More informationA New Algorithm to Compute Terms in Special Types of Characteristic Sequences
A New Algorithm to Compute Terms in Special Types of Characteristic Sequences Kenneth J. Giuliani 1 and Guang Gong 2 1 Dept. of Mathematical and Computational Sciences University of Toronto at Mississauga
More informationConstruction of a (64, 2 37, 12) Code via Galois Rings
Designs, Codes and Cryptography, 10, 157 165 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Construction of a (64, 2 37, 12) Code via Galois Rings A. R. CALDERBANK AT&T
More informationJournal of Number Theory
Journal of Number Theory 130 (2010) 1737 1749 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt A binary linear recurrence sequence of composite numbers Artūras
More informationOn the k-error linear complexity for p n -periodic binary sequences via hypercube theory
1 On the k-error linear complexity for p n -periodic binary sequences via hypercube theory Jianqin Zhou Department of Computing, Curtin University, Perth, WA 6102 Australia Computer Science School, Anhui
More informationA second infinite family of Steiner triple systems without almost parallel classes
A second infinite family of Steiner triple systems without almost parallel classes Darryn Bryant The University of Queensland Department of Mathematics Qld 4072, Australia Daniel Horsley School of Mathematical
More information