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
5 - On the linear complexity and lattice test of nonlinear pseudorandom number generators
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. 91 - 101Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , and , On lattice profile of the elliptic curve linear congruential generators. Period. Math. Hung. 68, 1–12, 2014.Google Scholar
[2] , and , Stream Ciphers and Number Theory. North-Holland Mathematical Library, volume 55. North-Holland, Amsterdam, 1998.
[3] , Lattice profile and linear complexity profile of pseudorandom number sequences. In: , and (eds.), International Conference on Finite Fields and Applications. Lecture Notes in Computer Science, volume 2948, pp. 69–78. Springer, 2003.
[4] and , Lattice structure and linear complexity profile of nonlinear pseudorandom number generators. Appl. Algebra Eng. Commun. Comput. 13(6), 499–508, 2003.Google Scholar
[5] and , Lattice structure of nonlinear pseudorandom number generators in parts of the period. Monte Carlo and quasi-Monte Carlo Methods 2002, pp. 199–211. Springer, New York, 2004.
[6] , and , Counting functions and expected values for the lattice profile at n. Finite Fields Appl. 10(4), 636–652, 2004.Google Scholar
[7] , and , A survey of quadratic and inversive congruential pseudorandom numbers. Monte Carlo and quasi-Monte Carlo Methods. Lecture Notes in Statistics, volume 127, pp. 66–97. Springer, Salzburg, 1996.
[8] , and , Geometric Algorithms and Combinatorial Optimization. Springer, Berlin, 1993.
[9] , Mathematical methods in large-scale computing units. Proceedings of a Second Symposium on Large-Scale Digital Calculating Machinery, 1949, pp. 141–146. Harvard University Press, Cambridge, MA, 1951.
[10] , The structure of linear congruential sequences. Applications of Number Theory to Numerical Analysis (Proc. Symp., Univ. Montreal, Montreal, 1971), pp. 249–285. Academic Press, New York, 1972.
[11] , and , Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1997.
[12] , The linear complexity profile and the jump complexity of keystream sequences. In: (ed.), EUROCRYPT. Lecture Notes in Computer Science, volume 473, pp. 174–188. Springer, 1990.
[13] , New methods for pseudorandom numbers and pseudorandom vector generation. Winter Simulation Conference, pp. 264–269. ACM Press, 1992.
[14] , Random Number Generation and quasi-Monte Carlo Methods. CBMS-NSF Regional Conference Series in Applied Mathematics, volume 63. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992.
[15] . New developments in uniform pseudorandom number and vector generation. Monte Carlo and quasi-Monte Carlo Methods. Lecture Notes in Statistics, volume 107, pp. 87–120. Springer, Las Vegas, NV, 1994.
[16] , Some computable complexity measures for binary sequences. Proc. Int. Conf. on Sequences and their Applications (SETA'98), pp. 67–78. Springer, Singapore, 1999.
[17] , Linear complexity and related complexity measures for sequences. In: and (eds.), INDOCRYPT. Lecture Notes in Computer Science, volume 2904, pp. 1–17. Springer, 2003.
[18] and , Recent advances in the theory of nonlinear pseudorandom number generators. In: , and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 86– 102. Springer, Berlin, 2002.Google Scholar
[19] and , On the lattice structure of pseudorandom numbers generated over arbitrary finite fields. Appl. Algebra Eng. Commun. Comput. 12(3), 265–272, 2001.Google Scholar
[20] and , Lattice structure and linear complexity of nonlinear pseudorandom numbers. Appl. Algebra Eng. Commun. Comput. 13(4), 319–326, 2002.Google Scholar
[21] and , On the structure of inversive pseudorandom number generators. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science, volume 4851, pp. 207–216. Springer, 2007.
[22] and , Rational Points on Curves over Finite Fields: Theory and Applications. London Mathematical Society Lecture Note Series, volume 285. Cambridge University Press, Cambridge, 2001.
[23] and , On the structure of digital explicit nonlinear and inversive pseudorandom number generators. J. Complexity 26(1), 43–50, 2010.Google Scholar
[24] , Stream ciphers. Contemporary Cryptology: The Science of Information Integrity, pp. 65–134. IEEE Press, New York, 1992.
[25] , On the uniformity of distribution of the Naor Reingold pseudo-random function. Finite Field Appl. 7(2), 318–326, 2001.Google Scholar
[26] and , Pseudorandom sequences. Topics in Geometry, Coding Theory and Cryptography. Algebra and Applications, volume 6, pp. 135–166. Springer, Dordrecht, 2007.
[27] , Recent results on recursive nonlinear pseudorandom number generators (invited paper). In: and (eds.), Sequences and their Applications, SETA 2010. Lecture Notes in Computer Science, volume 6338, pp. 113–124. Springer, Berlin, 2010.
[28] and , On the linear complexity profile of explicit nonlinear pseudorandom numbers. Inf. Process. Lett. 85, 13–18, 2003.Google Scholar
- 2
- Cited by