Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
15 - A trigonometric approach for Chebyshev polynomials over finite fields
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 255 - 279Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , , and , Trigonometry in finite fields and a new Hartley transform. In: Proc. IEEE Int. Symp.—Information Theory (ISIT'98), p. 293. IEEE, New York, 1998.
[3] and , Dickson polynomial permutations. In: , , and (eds.), Finite Fields and Applications. Contemporary Mathematics, volume 461, pp. 79–90. AMS, Providence, RI, 2008.
[4] , Dickson polynomials of the second kind that are permutations. Can. J. Math. 46, 225–238, 1994.Google Scholar
[5] and , On the permutation behaviour of Dickson polynomials of the second kind. Finite Fields Appl. 8(4), 519–530, 2002.Google Scholar
[6] and , Cryptography using Chebyshev polynomials. Proc. 2004 Maple Summer Workshop. Preprint available at www.cecm.sfu.ca/CAG/products2003.shtml, 2004.Google Scholar
[8] and , Permutation properties of Chebyshev polynomials of the second kind over a finite field. Finite Fields Appl. 1(1), 115–125, 1995.Google Scholar
[10] , and , On the security of public-key algorithms based on Chebyshev polynomials over the finite field ZN. IEEE Trans. Comput. 59(10), 1392–1401, 2010.Google Scholar
[11] and , Finite Fields, second edition. Cambridge University Press, Cambridge, 1997.
[12] , and , Dickson Polynomials. Longman Scientific and Technical, Pitman Monographs and Surveys in Pure and Applied Mathematics, volume 65, Longman, 1993.
[13] , and , Public-key encryption based on Chebyshev polynomials over GF(q). Inf. Process. Lett. 111(2), 51–56, 2010.Google Scholar
[14] and , Chebyshev Polynomials. Chapman & Hall/CRC, Boca Raton, FL, 2003.
[15] , Permutation polynomials in one and several variables. PhD Thesis, University of Tasmania, 1982.
[16] , Chebyshev polynomials over finite fields and reversibility of σ-automata on square grids. Theor. Comput. Scie. 320(2–3), 465–483, 2004.Google Scholar
[17] and , Handbook of Finite Fields. Chapman & Hall/CRC, Boca Raton, FL, 2013.
[18] and , Dickson polynomials over finite fields. Finite Fields Appl. 18(4), 814–831, 2012.Google Scholar
- 4
- Cited by