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
2 - Partially bent functions and their properties
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. 22 - 38Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , , and , On cryptographic properties of the coset of R(1, m). IEEE Trans. Inf. Theory 47, 1494–1513, 2001.Google Scholar
[3] and , Bent functions of maximal degree. IEEE Trans. Inf. Theory 58, 1186–1190, 2012.Google Scholar
[4] and , A construction of bent functions from plateaued functions. Des. Codes Cryptogr. 66, 231–242, 2013.Google Scholar
[5] , and , A construction of weakly and non-weakly regular bent functions. J. Comb. Theory Ser. A 119, 420–429, 2012.Google Scholar
[6] , and , On the dual of (non)-weakly regular bent functions and self-dual bent functions. Adv. Math. Commun. 7, 425–440, 2013.Google Scholar
[7] , and , Generalized Maiorana–McFarland class and normality of p-ary bent functions. Finite Fields Appl. 24, 105–117, 2013.Google Scholar
[8] and , A unifying construction for difference sets. J. Comb. Theory Ser. A 80, 13–78, 1997.Google Scholar
[9] , Elementary Hadamard difference sets. PhD Dissertation, University of Maryland, 1974.
[10] and , Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52, 2018–2032, 2006.Google Scholar
[11] , and , Generalized bent functions and their properties. J. Comb. Theory Ser. A 40, 90–107, 1985.Google Scholar
[12] and , Quadratic functions with prescribed spectra. Des. Codes Cryptogr. 66, 257–273, 2013.Google Scholar
[13] , Perfect nonlinear S-boxes. Advances in Cryptology, EUROCRYPT '91 (Brighton, 1991). Lecture Notes in Computer Science, volume 547, pp. 378–386. Springer, Berlin, 1991.
[14] , The Algebraic Structure of Group Rings. Wiley, New York, 1977.
[15] , private communication.
[16] , Finite Geometry and Character Theory. Springer-Verlag, Berlin, 1995.
[17] , and , Strongly regular graphs associated with ternary bent functions. J. Comb. Theory Ser. A 117, 668–682, 2010.Google Scholar
- 6
- Cited by