Pseudorandom Sequences II: Exponential Sums and Uniform Distribution
|
|
- Beverly Perkins
- 5 years ago
- Views:
Transcription
1 Pseudorandom Sequences II: Exponential Sums and Uniform Distribution Arne Winterhof Austrian Academy of Sciences Johann Radon Institute for Computational and Applied Mathematics Linz Carleton University 2010 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
2 Pseudorandom sequences are generated by a deterministic algorithm and look random. Desirable randomness properties depend on the application! cryptography: unpredictability numerical integration (quasi-monte Carlo): uniform distribution radar: distinction from reflected signal gambling: a good lawyer A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
3 Uniform distribution? A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
4 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
5 Discrepancy Γ = { } (γ n,0,..., γ n,s 1 ) N n=1 sequence of N points in the s-dimensional unit interval [0, 1) s (Γ) = sup B [0,1) s T Γ (B) N B, where T Γ (B) is the number of points of Γ inside the box B = [α 0, β 0 ) [α s 1, β s 1 ) [0, 1) s and the supremum is taken over all such boxes. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
6 Quasi-Monte Carlo Integration x 0,..., x N 1 [0, 1) s [0,1) s f (x)dx 1 N N 1 f (x n ) n=0 How big is the integration error? f (x)dx 1 [0,1) N s N 1 f (x n ) =? n=0 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
7 Uniform distribution is important! A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
8 Bounded variation is important! A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
9 Koksma-Hlawka Inequality Γ = (x 0,..., x N 1 ) f (x)dx 1 [0,1) N s N 1 f (x n ) V (f ) (Γ), n=0 where V (f ) is a measure for the variation of f. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
10 How do we estimate the discrepancy? A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
11 We estimate the discrepancy using exponential sums (additive character sums). A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
12 Erdős-Turan-Koksma inequality (Γ) where ( ) s H N Σ (s) s 1 0< a H j=0 1 max{ a j, 1} N ( ) N (Γ, a) = s 1 exp 2πi a j γ n,j n=1 j=0 Σ (s) and the outer sum is taken over all integer vectors a = (a 0,..., a s 1 ) Z s \ {0} with a = max a j H. j=0,...,s 1 N (Γ, a), A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
13 Group characters Let (G, ) be a finite Abelian group. A mapping χ : G C (F = F \ {0}) is called a character of G if χ(g h) = χ(g)χ(h) for all g, h G. Example. χ 0 (g) = 1 for all g G is called the trivial character. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
14 The character group With the following multiplication of two character χ and ψ is the set of characters Ĝ a group isomorphic to G: χψ(g) = χ(g)ψ(g), g G. Example. G cyclic of order n with generator g χ(g j ) = χ(g) j χ(g) n = 1 χ k (g) = exp(2πik/n), 0 k n 1 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
15 Orthogonality relation 1 G χ(g) = 0, χ χ 0 g G χ(g) = 0, χ Ĝ χ(g h 1 ) = χ Ĝ g 1 G { 1, g = h, 0, g h. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
16 Equations and character sums Let f : G s G be a mapping and h G. Let N(h, f ) be the number of solutions of Then we have N(h, f ) = 1 G f (g 1,..., g s ) = h, (g 1,..., g s ) G s. g 1,...,g s G χ Ĝ = G s G χ(f (g 1,..., g s )h 1 ) N(h, f ) G s 1 < max χ χ 0 χ χ 0 χ(h 1 ) g 1,...,g s G g 1,...,g s G χ(f (g 1,..., g s )). χ(f (g 1,..., g s )) A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
17 From F q to the unit interval (s n ) sequence over F p = {0, 1,..., p 1}, p prime x n = s n /p [0, 1) q = p r, {β 1,..., β r } basis of F q over F p (s n ) sequence over F q with s n = s n,1 β s n,r β r x n = s n,r p s n,1 p r [0, 1) A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
18 (Γ) = sup B [0,1) s T Γ (B) N B, where T Γ (B) is the number of points of Γ inside the box B = [α 0, β 0 ) [α s 1, β s 1 ) [0, 1) s. T Γ (B) can be expressed in terms of character sums (cf. Erdős-Turan-Koksma). A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
19 Characters of finite fields F q finite field of q elements additive characters: (G, ) = (F q, +) q = p prime: ψ a (x) = exp(2πiax/p), a F p q = p r, Tr(x) = x + x p x pr 1, ψ a (x) = exp(2πitr(ax)/p) multiplicative characters: (G, ) = (F q, ) g primitive element of F q (F q = {g j : 0 j q 2}) χ k (g j ) = exp(2πijk/(q 1)), 0 k, j q 2 Example: χ (q 1)/2 (g j ) ( = ) ( 1) j quadratic character q = p: χ (p 1)/2 (x) = Legendre symbol convention: χ k (0) = 0, k 0, χ 0 (0) = 1 x p A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
20 Character sums f, g : F q F q χ multiplicative character and ψ additive character of F q Complete sum: S(χ, ψ, f, g) = x F q χ(f (x))ψ(g(x)) Incomplete sum: X F q S(χ, ψ, f, g, X ) = x X χ(f (x))ψ(g(x)) Trivial bound: S(χ, ψ, f, g, X ) X A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
21 Complete sums Weil-bound: Let f, g F q [X ], χ a multiplicative character and ψ and additive character of F q. If χ is nontrivial of order s > 1 and f is not of the form f = au s, a F q, u F q [X ], or ψ is nontrivial and g is not of the form g = v p v + b, b F q, v F q [X ], then we have S(χ, ψ, f, g) (deg(f ) + deg(g) 1)q 1/2. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
22 Gauss sums Let χ be a multiplicative and ψ an additive Character of F q. Then are called Gauss sums. G(χ, ψ) = c F q If χ and ψ are both nontrivial, we have χ(c)ψ(c) G(χ, ψ) = q 1/2. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
23 G(χ, ψ) 2 = G(χ, ψ)g(χ, ψ) = χ(cd }{{} 1 )ψ(c d) u c,d F q = χ(u) ψ(c(1 u 1 )) u F q c F q = χ(u) + q 1 = q u 0,1 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
24 Gauss sums Type II S n (ψ) = c F q ψ(c n ), n q 1 Let χ be a multiplicative character of order n: 1 + χ(x) + χ 2 (x) χ n 1 (x) n = 1 χ(x) = 1 x = c n and 0 otherwise. n 1 S n (ψ) = G(χ j, ψ) (n 1)q1/2 j=0 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
25 Incomplete sums over intervals Main Idea: Reduce to complete sums and apply, say, the Weil bound. q = p prime, χ nontrivial multiplicative character of F p N 1 χ(n) = O(p1/2 log p). n=0 Method of Polya and Vinogradov: N 1 N 1 χ(n) = χ(x) 1 ψ(x n) n=0 p n=0 x F p ψ 1 N 1 p χ(x)ψ(x) ψ(n) ψ x F p n=0 }{{} p 1/2 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
26 Vinogradov s inequality: N 1 ψ(n) = ψ ψ 0 p 1 a=1 p 1 a=1 p n=0 exp(2πian/p) 1 exp(2πia/p) 1 p 1 1 sin(πia/p) p p 1 dx x = p log p a=1 1 min{a, p a} A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
27 Linear Pseudorandom Number Generators F q finite field of q elements, a, b, x 0 F q, a 0 x n+1 = ax n + b, n 0 Corresponding exponential sums are Gauss sums. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
28 Nonlinear recurrence sequences u 0 F p, f F p [X ], d = deg(f ) 2 u n+1 = f (u n ), n 0 (purely) periodic with period t q N 1 S N = ψ(u n ) = O(N 1/2 p 1/2 (log p) 1/2 ) n=0 Polya-Vinogradov fails! A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
29 Extend and conquer X, Y F q ψ(xy) ( X Y q)1/2 x X y Y A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
30 ψ(xy) x X y Y 2 ( ) 2 ψ(xy) Cauchy-Schwarz x X y Y X 2 ψ(xy) extend x X y Y X 2 ψ(xy) conquer x F q y Y = X ψ(x(y 1 y 2 )) = X Y q x F q y 1,y 2 Y A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
31 Clone N 1 N 1 ψ(u n ) ψ(u n+k ) 2k n=0 n=0 N 1 K 1 K 1 K S N ψ(u n+k ) + 2 k n=0 k=0 k=0 }{{} <K 2 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
32 Nonlinear Pseudorandom Numbers f F q [X ], 2 deg(f ) q 1, x 0 F q u n+1 = f (u n ), n 0 N 1 S N = ψ(u n ) n=0 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
33 Niederreiter/Shparlinski, 1999: S N = O ( N 1/2 p 1/2 log(d) 1/2 log(p) 1/2) Main idea of proof: Reduction to Weil-bound via cloning and extend and conquer: ψ(f (x)) (deg(f ) 1)q1/2 x F q Here: F (X ) = a i F ki (X ) Exponential degree growth when iterating f (X ) is the reason for the weakness of these bounds. (Cf. linear complexity bounds.) A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
34 Inversive Generators a, b, y 0 F q, a 0 { ay y n+1 = ayn q 2 1 n + b, y + b = n 0, b, y n = 0. Niederreiter/Shparlinski, 2001: D N = O(N 1/2 p 1/4 log s (p)) Reason for better result: f (X ) = bx +a X, F j(x ) = a j X +b j c j X +d A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
35 Dickson and Power Generator The Dickson polynomial D e (X, a) F q [X ] is defined by the following recurrence relation D e (X, a) = XD e 1 (X, a) ad e 2 (X, a), e = 2, 3,..., with initial values D 0 (X, a) = 2, D 1 (X, a) = X, where a F q. Obviously, the degree of D e is e. Moreover, if a {0, 1} then we have D e (D f (X, a), a) = D ef (X, a). A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
36 a = 0: D e (X, 0) = X e, e 2 p n+1 = p e n, n 0 power generator power generator: Friedlander/Shparlinski, 2001 Reason for better result: F k (X ) = X ek mod p 1 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
37 a = 1: u n+1 = D e (u n, 1), n 0, with some initial value u 0 and e 2. Dickson generator Dickson generator: Gomez/Gutierrez/Shparlinski, 2006 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
38 Redéi generator Suppose that r(x ) = X 2 αx β F p [X ] is an irreducible quadratic polynomial with the two different roots ξ and ζ = ξ p in F p 2. Then any polynomial b(x ) F p 2[X ] can uniquely be written in the form b(x ) = g(x ) + h(x )ξ with g(x ), h(x ) F p [X ]. We consider the elements (X + ξ) e = g e (X ) + h e (X )ξ. e is the degree of the polynomial g e (X ), and h e (X ) has degree at most e 1. The Rédei function f e (X ) of degree e is then given by f e (X ) = g e(x ) h e (X ). A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
39 u n+1 = f e (u n ), n 0, with a Rédei permutation f e (X ) and some initial element u 0 F p. Redéi generator: Gutierrez/W., 2007 A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
40 p-weight Degree n nonnegative integer p-weight of n: σ p ( l i=0 n i p i ) = l n i, 0 n i < p. i=0 0 e 1 < e 2 < < e l integers, q = p r, f (X ) = l i=1 γ ix e i F q [X ] nonzero polynomial over F q with γ i 0, i = 1,..., l p-weight degree of f : w p (f ) deg(f ) w p (f ) = max{σ p (e i ) : 1 i l}. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
41 If g(x ) F q [X ] and {β 1,..., β r } is a fixed ordered F p -basis of F q, we define G(X 1,..., X r ) = Tr(g(X 1 β X r β r )), where Tr(X ) = X + X p X pr 1 is the absolute trace function of F q. Then the transformed polynomial G R (X 1,..., X r ) of g(x ) is the unique polynomial with all local degrees smaller than p such that G R (X 1,..., X r ) G(X 1,..., X r ) mod (X p 1 X 1,..., X p r X r ). The interest of this construction relies on the fact that, under certain assumptions, the total degree of G R (X 1,..., X r ) coincides with the p-weight degree of g(x ). A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
42 Instead of univariate Weil-bound ψ q (g(x)) (deg(g) 1)q1/2 x F q we apply the multivariate Weil-bound ψ p ((G R (x 1,..., x r )) x 1,...,x r F p (w p 1)p r 1/2 (Ibeas/W., 2010) A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
43 f (X ) = αx d + f (X ) F q [X ] with α 0, w p ( f ) < σ p (d), d 2, (1) and ( gcd d, q 1 ) σ p (d) r. p 1 (2) If the sequence (x n ) defined by x n+1 = f (x n ), n 0, x 0 F q, with f (X ) F q [X ] of the form (1) satisfying (2) is purely periodic with period t, then S a,n (f ) N 1/2 q 1/2 (log w) 1/2 /(log p) 1/2, 1 N t, a 0, where w = σ p (d) > 1 is the p-weight degree of f (X ) and the implied constant depends only on s. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
44 Polynomial Systems Let {F 1,..., F r } be a system of r 2 polynomials F i F q [X i,..., X m ], i = 1,..., r, defined in the following way: F 1 (X 1,..., X r ) = X 1 G 1 (X 2,..., X r ) + H 1 (X 2,..., X r ), F 2 (X 1,..., X r ) = X 2 G 2 (X 3,..., X r ) + H 2 (X 3,..., X r ),... F r 1 (X 1,..., X r ) = X r 1 G r 1 (X r ) + H r 1 (X r ), F r (X 1,..., X r ) = g r X r + h r. Using the following vector notation F = (F 1 (X 1,..., X r ),..., F r (X 1,..., X r )), we define the following vector sequence w n+1 = F ( w n ), n = 0, 1,.... (Ostafe, Shparlinski 2009) A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
45 Open Problem Find more good nonlinear generators. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
46 Thank you for your attention. A.Winterhof (RICAM (Linz)) Uniform Distribution Carleton University / 45
Pseudorandom Sequences I: Linear Complexity and Related Measures
Pseudorandom Sequences I: Linear Complexity and Related Measures Arne Winterhof Austrian Academy of Sciences Johann Radon Institute for Computational and Applied Mathematics Linz Carleton University 2010
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationOn the parity of k-th powers modulo p
On the parity of k-th powers modulo p Jennifer Paulhus Kansas State University paulhus@math.ksu.edu www.math.ksu.edu/ paulhus This is joint work with Todd Cochrane and Chris Pinner of Kansas State University
More informationImproved Discrepancy Bounds for Hybrid Sequences. Harald Niederreiter. RICAM Linz and University of Salzburg
Improved Discrepancy Bounds for Hybrid Sequences Harald Niederreiter RICAM Linz and University of Salzburg MC vs. QMC methods Hybrid sequences The basic sequences Deterministic discrepancy bounds The proof
More informationCarlitz Rank and Index of Permutation Polynomials
arxiv:1611.06361v1 [math.co] 19 Nov 2016 Carlitz Rank and Index of Permutation Polynomials Leyla Işık 1, Arne Winterhof 2, 1 Salzburg University, Hellbrunnerstr. 34, 5020 Salzburg, Austria E-mail: leyla.isik@sbg.ac.at
More informationStephen Cohen, University of Glasgow Methods for primitive and normal polynomials
Stephen Cohen, University of Glasgow Methods for primitive and normal polynomials Primitive and normal polynomials over a finite field are, of course, particular examples of irreducible polynomials over
More informationFourier Analysis. 1 Fourier basics. 1.1 Examples. 1.2 Characters form an orthonormal basis
Fourier Analysis Topics in Finite Fields (Fall 203) Rutgers University Swastik Kopparty Last modified: Friday 8 th October, 203 Fourier basics Let G be a finite abelian group. A character of G is simply
More informationOn components of vectorial permutations of F n q
On components of vectorial permutations of F n q Nurdagül Anbar 1, Canan Kaşıkcı 2, Alev Topuzoğlu 2 1 Johannes Kepler University, Altenbergerstrasse 69, 4040-Linz, Austria Email: nurdagulanbar2@gmail.com
More informationExplicit Bounds for the Burgess Inequality for Character Sums
Explicit Bounds for the Burgess Inequality for Character Sums INTEGERS, October 16, 2009 Dirichlet Characters Definition (Character) A character χ is a homomorphism from a finite abelian group G to C.
More informationGauss periods and related Combinatorics
momihara@educkumamoto-uacjp 23-01-2015 Fundamentals of characters of abelian groups A character ψ of G is a homomorphism from G to C Ĝ: the set of all characters of G e: the exponent of G Remark The image
More informationMath 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums
Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums Finally, we consider upper bounds on exponential sum involving a character,
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
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 informationAn Additive Characterization of Fibers of Characters on F p
An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009
More informationExponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus
ACTA ARITHMETICA XCII1 (2000) Exponential sus and the distribution of inversive congruential pseudorando nubers with prie-power odulus by Harald Niederreiter (Vienna) and Igor E Shparlinski (Sydney) 1
More informationTENSOR PRODUCTS, RESTRICTION AND INDUCTION.
TENSOR PRODUCTS, RESTRICTION AND INDUCTION. ANDREI YAFAEV Our first aim in this chapter is to give meaning to the notion of product of characters. Let V and W be two finite dimensional vector spaces over
More informationThe Weil bounds. 1 The Statement
The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil
More informationFinite Field Waring s Problem
Finite Field Waring s Problem 12/8/10 1 Introduction In 1770, Waring asked the following uestion: given d N, can every positive integer can be written as a sum of a bounded number of dth powers of positive
More informationNormal bases and primitive elements over finite fields
Normal bases and primitive elements over finite fields Giorgos Kapetanakis Department of Mathematics, University of Crete 11th International Conference on Finite Fields and their Applications Giorgos Kapetanakis
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationRandomness and Complexity of Sequences over Finite Fields. Harald Niederreiter, FAMS. RICAM Linz and University of Salzburg (Austria)
Randomness and Complexity of Sequences over Finite Fields Harald Niederreiter, FAMS RICAM Linz and University of Salzburg (Austria) Introduction A hierarchy of complexities Complexity and random sequences
More informationExponential sums over finite fields
Exponential sums over finite fields Tim Browning Autumn, 2010 1 Introduction Let p be prime and let F p = Z/pZ. Given polynomials f, g F p [X] with g non-zero, sums of the sort S = e 2πif(x)/g(x) p C arise
More informationA PROOF OF BURNSIDE S p a q b THEOREM
A PROOF OF BURNSIDE S p a q b THEOREM OBOB Abstract. We prove that if p and q are prime, then any group of order p a q b is solvable. Throughout this note, denote by A the set of algebraic numbers. We
More informationCHARACTERS OF FINITE ABELIAN GROUPS (SHORT VERSION)
CHARACTERS OF FINITE ABELIAN GROUPS (SHORT VERSION) KEITH CONRAD 1. Introduction The theme we will study is an analogue on finite abelian groups of Fourier analysis on R. A Fourier series on the real line
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationOn the distribution of the elliptic curve power generator
On the distribution of the elliptic curve power generator László Mérai Eötvös Loránd University Budapest 26. 06. 2012. László Mérai (Budapest) On the elliptic curve power generator 26. 06. 2012. 1 / 16
More informationChapter 4. Characters and Gauss sums. 4.1 Characters on finite abelian groups
Chapter 4 Characters and Gauss sums 4.1 Characters on finite abelian groups In what follows, abelian groups are multiplicatively written, and the unit element of an abelian group A is denoted by 1 or 1
More informationFinite fields, randomness and complexity. Swastik Kopparty Rutgers University
Finite fields, randomness and complexity Swastik Kopparty Rutgers University This talk Three great problems: Polynomial factorization Epsilon-biased sets Function uncorrelated with low-degree polynomials
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationNUMBERS OF SOLUTIONS OF EQUATIONS IN FINITE FIELDS. The equations to be considered here are those of the type
BULLETIN (Old Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 55 (949), Pages 497 508 S (XX)0000-0 NUMBERS OF SOLUTIONS OF EQUATIONS IN FINITE FIELDS ANDRÉ WEIL The equations to be considered here
More informationExpansions of quadratic maps in prime fields
Expansions of quadratic maps in prime fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract Let f(x) = ax 2 +bx+c Z[x] be a quadratic polynomial with
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 informationShort Kloosterman Sums for Polynomials over Finite Fields
Short Kloosterman Sums for Polynomials over Finite Fields William D Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@mathmissouriedu Asma Harcharras Department of Mathematics,
More informationChapter 4. Greatest common divisors of polynomials. 4.1 Polynomial remainder sequences
Chapter 4 Greatest common divisors of polynomials 4.1 Polynomial remainder sequences If K is a field, then K[x] is a Euclidean domain, so gcd(f, g) for f, g K[x] can be computed by the Euclidean algorithm.
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationThe zeta function, L-functions, and irreducible polynomials
The zeta function, L-functions, and irreducible polynomials Topics in Finite Fields Fall 203) Rutgers University Swastik Kopparty Last modified: Sunday 3 th October, 203 The zeta function and irreducible
More informationSeveral generalizations of Weil sums
Several generalizations of Weil sums Fan R. K. Chung Bellcore Morristown, NJ 07960 Abstract We consider several generalizations and variations of the character sum inequalities of Weil and Burgess. A number
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 informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More information2-4 Zeros of Polynomial Functions
Write a polynomial function of least degree with real coefficients in standard form that has the given zeros. 33. 2, 4, 3, 5 Using the Linear Factorization Theorem and the zeros 2, 4, 3, and 5, write f
More informationConstruction of pseudorandom binary lattices using elliptic curves
Construction of pseudorandom binary lattices using elliptic curves László Mérai Abstract In an earlier paper Hubert, Mauduit and Sárközy introduced and studied the notion of pseudorandomness of binary
More informationCyclotomic schemes and related problems
momihara@educkumamoto-uacjp 16-06-2014 Definition Definition: Cayley graph G: a finite abelian group D: an inverse-closed subset of G (0 D and D = D) E := {(x, y) x, y G, x y D} (G, E) is called a Cayley
More informationDirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007
Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).
More informationCSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function
CSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function that is reasonably random in behavior, then take any
More informationALGORITHMS FOR ALGEBRAIC CURVES
ALGORITHMS FOR ALGEBRAIC CURVES SUMMARY OF LECTURE 3 In this text the symbol Θ stands for a positive constant. 1. COMPLEXITY THEORY AGAIN : DETERMINISTIC AND PROBABILISTIC CLASSES We refer the reader to
More informationOn the Hansen-Mullen Conjecture for Self-Reciprocal Irreducible Polynomials
On the Hansen-Mullen Conjecture for Self-Reciprocal Irreducible Polynomials Giorgos N. Kapetanakis (joint work with T. Garefalakis) University of Crete Fq10 July 14, 2011 Giorgos Kapetanakis (Crete) On
More informationInformation Theory. Lecture 7
Information Theory Lecture 7 Finite fields continued: R3 and R7 the field GF(p m ),... Cyclic Codes Intro. to cyclic codes: R8.1 3 Mikael Skoglund, Information Theory 1/17 The Field GF(p m ) π(x) irreducible
More informationInterpolation of Functions Related to the Integer Factoring Problem
Interpolation of Functions Related to the Integer Factoring Problem Clemens Adelmann 1 and Arne Winterhof 2 1 Institut für Analysis und Algebra, Technische Universität Braunschweig, Pockelsstraße 14, D-38106
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 the N th linear complexity of p-automatic sequences over F p
On the N th linear complexity of p-automatic sequences over F p László Mérai and Arne Winterhof Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstr.
More informationRepresentations Associated to the Group Matrix
Brigham Young University BYU ScholarsArchive All Theses and Dissertations 014-0-8 Representations Associated to the Group Matrix Joseph Aaron Keller Brigham Young University - Provo Follow this and additional
More informationOn the existence of primitive completely normal bases of finite fields
On the existence of primitive completely normal bases of finite fields Theodoulos Garefalakis a, Giorgos Kapetanakis b, a Department of Mathematics and Applied Mathematics, University of Crete, Voutes
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 informationThe Hidden Root Problem
EPFL 2008 Definition of HRP Let F q k be a finite field where q = p n for prime p. The (Linear) Hidden Root Problem: let r N0 be given and x F q k hidden access to oracle Ox that given (a, b) F 2 q k returns
More informationMath 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours
Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours Name: Please read the questions carefully. You will not be given partial credit on the basis of having misunderstood a question, and please
More informationCHARACTERS OF FINITE GROUPS.
CHARACTERS OF FINITE GROUPS. ANDREI YAFAEV As usual we consider a finite group G and the ground field F = C. Let U be a C[G]-module and let g G. Then g is represented by a matrix [g] in a certain basis.
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationLecture 3 Small bias with respect to linear tests
03683170: Expanders, Pseudorandomness and Derandomization 3/04/16 Lecture 3 Small bias with respect to linear tests Amnon Ta-Shma and Dean Doron 1 The Fourier expansion 1.1 Over general domains Let G be
More informationPolynomials with Special Properties over Finite Fields
University of Crete School of Sciences and Engineering Department of Mathematics and Applied Mathematics Doctoral Thesis Polynomials with Special Properties over Finite Fields Giorgos N. Kapetanakis Advisor:
More informationPseudo-Random Numbers Generators. Anne GILLE-GENEST. March 1, Premia Introduction Definitions Good generators...
14 pages 1 Pseudo-Random Numbers Generators Anne GILLE-GENEST March 1, 2012 Contents Premia 14 1 Introduction 2 1.1 Definitions............................. 2 1.2 Good generators..........................
More informationOn character sums and complex functions over nite elds
On character sums and complex functions over nite elds N. V. Proskurin April 17, 2018 In this lecture I want to present the complex functions over nite elds theory. The theory has been developed through
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 9B ERROR CONTROL CODING Spring 005 Solutions for Homework 1. (Weights of codewords in a cyclic code) Let g(x) be the generator polynomial of a binary cyclic code of length n. (a) Show that if g(x) has
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationCOMMUTATIVE PRESEMIFIELDS AND SEMIFIELDS
COMMUTATIVE PRESEMIFIELDS AND SEMIFIELDS ROBERT S. COULTER AND MARIE HENDERSON Abstract. Strong conditions are derived for when two commutative presemifields are isotopic. It is then shown that any commutative
More informationOn the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves Simon R. Blacburn Department of Mathematics Royal Holloway University of London Egham, Surrey, TW20 0EX, UK s.blacburn@rhul.ac.u
More information2 ALGEBRA II. Contents
ALGEBRA II 1 2 ALGEBRA II Contents 1. Results from elementary number theory 3 2. Groups 4 2.1. Denition, Subgroup, Order of an element 4 2.2. Equivalence relation, Lagrange's theorem, Cyclic group 9 2.3.
More informationCS 6260 Some number theory
CS 6260 Some number theory Let Z = {..., 2, 1, 0, 1, 2,...} denote the set of integers. Let Z+ = {1, 2,...} denote the set of positive integers and N = {0, 1, 2,...} the set of non-negative integers. If
More informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More informationEXPLICIT EVALUATIONS OF SOME WEIL SUMS. 1. Introduction In this article we will explicitly evaluate exponential sums of the form
EXPLICIT EVALUATIONS OF SOME WEIL SUMS ROBERT S. COULTER 1. Introduction In this article we will explicitly evaluate exponential sums of the form χax p α +1 ) where χ is a non-trivial additive character
More informationFields and Galois Theory Fall 2004 Professor Yu-Ru Liu
Fields and Galois Theory Fall 2004 Professor Yu-Ru Liu CHRIS ALMOST Contents 1 Introduction 3 1.1 Motivation....................................................... 3 1.2 Brief Review of Ring Theory............................................
More informationMATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11
MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationGalois Theory TCU Graduate Student Seminar George Gilbert October 2015
Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationAbstract Algebra: Chapters 16 and 17
Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set
More informationCS 6815: Lecture 4. September 4, 2018
XS = X s... X st CS 685: Lecture 4 Instructor: Eshan Chattopadhyay Scribe: Makis Arsenis and Ayush Sekhari September 4, 208 In this lecture, we will first see an algorithm to construct ɛ-biased spaces.
More informationA conjecture of Evans on Kloosterman sums
Evan P. Dummit, Adam W. Goldberg, and Alexander R. Perry 2009 Wisconsin Number Theory REU Project Notation We will make use of the following notation: p odd prime Additive character ψ : F p C, x e 2πix
More informationBURGESS BOUND FOR CHARACTER SUMS. 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1].
BURGESS BOUND FOR CHARACTER SUMS LIANGYI ZHAO 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1]. We henceforth set (1.1) S χ (N) = χ(n), M
More informationFIELD THEORY. Contents
FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions
More informationELEMENTARY PROOF OF DIRICHLET THEOREM
ELEMENTARY PROOF OF DIRICHLET THEOREM ZIJIAN WANG Abstract. In this expository paper, we present the Dirichlet Theorem on primes in arithmetic progressions along with an elementary proof. We first show
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 informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationarxiv: v1 [math.nt] 7 Sep 2015
THE ARITHMETIC OF CONSECUTIVE POLYNOMIAL SEQUENCES OVER FINITE FIELDS arxiv:1509.01936v1 [math.nt] 7 Sep 2015 DOMINGO GÓMEZ-PÉREZ, ALINA OSTAFE, AND MIN SHA Abstract. Motivated by a question of van der
More informationSolutions of exercise sheet 11
D-MATH Algebra I HS 14 Prof Emmanuel Kowalski Solutions of exercise sheet 11 The content of the marked exercises (*) should be known for the exam 1 For the following values of α C, find the minimal polynomial
More informationThe Calderon-Vaillancourt Theorem
The Calderon-Vaillancourt Theorem What follows is a completely self contained proof of the Calderon-Vaillancourt Theorem on the L 2 boundedness of pseudo-differential operators. 1 The result Definition
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
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 informationSummation polynomials and the discrete logarithm problem on elliptic curves
Summation polynomials and the discrete logarithm problem on elliptic curves Igor Semaev Department of Mathematics University of Leuven,Celestijnenlaan 200B 3001 Heverlee,Belgium Igor.Semaev@wis.kuleuven.ac.be
More information1 Spring 2002 Galois Theory
1 Spring 2002 Galois Theory Problem 1.1. Let F 7 be the field with 7 elements and let L be the splitting field of the polynomial X 171 1 = 0 over F 7. Determine the degree of L over F 7, explaining carefully
More informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
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 informationContinuing the pre/review of the simple (!?) case...
Continuing the pre/review of the simple (!?) case... Garrett 09-16-011 1 So far, we have sketched the connection between prime numbers, and zeros of the zeta function, given by Riemann s formula p m
More informationarxiv: v1 [math.nt] 4 Oct 2016
ON SOME MULTIPLE CHARACTER SUMS arxiv:1610.01061v1 [math.nt] 4 Oct 2016 ILYA D. SHKREDOV AND IGOR E. SHPARLINSKI Abstract. We improve a recent result of B. Hanson (2015) on multiplicative character sums
More informationHigher-order Fourier analysis of F n p and the complexity of systems of linear forms
Higher-order Fourier analysis of F n p and the complexity of systems of linear forms Hamed Hatami School of Computer Science, McGill University, Montréal, Canada hatami@cs.mcgill.ca Shachar Lovett School
More informationCOUNTING SEPARABLE POLYNOMIALS IN Z/n[x]
COUNTING SEPARABLE POLYNOMIALS IN Z/n[x] JASON K.C. POLAK Abstract. For a commutative ring R, a polynomial f R[x] is called separable if R[x]/f is a separable R-algebra. We derive formulae for the number
More informationContradiction. Theorem 1.9. (Artin) Let G be a finite group of automorphisms of E and F = E G the fixed field of G. Then [E : F ] G.
1. Galois Theory 1.1. A homomorphism of fields F F is simply a homomorphism of rings. Such a homomorphism is always injective, because its kernel is a proper ideal (it doesnt contain 1), which must therefore
More informationIntroduction to Modern Cryptography Recitation 3. Orit Moskovich Tel Aviv University November 16, 2016
Introduction to Modern Cryptography Recitation 3 Orit Moskovich Tel Aviv University November 16, 2016 The group: Z N Let N 2 be an integer The set Z N = a 1,, N 1 gcd a, N = 1 with respect to multiplication
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More information