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
11 - Periodic structure of the exponential pseudorandom number generator
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. 190 - 203Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , and , Logarithmic Combinatorial Structures: A Probabilistic Approach. EMS Monographs in Mathematics. European Mathematical Society, Zürich, 2003.
[2] , and , A sum product estimate in finite fields and applications. Geom. Funct. Anal. 14, 27–57, 2004.Google Scholar
[3] , and , Product sets of rationals, multiplicative translates of subgroups in residue rings and fixed points of the discrete logarithm. Int. Math. Res. Notices 2008, 1–29, 2008. Corrigendum 2009, 3146–3147, 2009.Google Scholar
[4] , and , Distribution of elements of cosets of small subgroups and applications. Int. Math. Res. Notices 2012, 1968–2009, 2012.Google Scholar
[5] , , and , On congruences with products of variables from short intervals and applications. Proc. Steklov Math. Inst. 280, 67–96, 2013.Google Scholar
[6] , , and , Multiplicative congruences with variables from short intervals. J. Anal. Math., to appear.
[7] , On the number of positive integers ≤ x and free of prime factors > y. Ned. Acad. Wetensch. Proc. Ser. A. 54, 50–60, 1951.Google Scholar
[8] and , Sum-product estimates for rational functions. Proc. London Math. Soc. 104, 1–26, 2012.Google Scholar
[9] and , On the concentration of points on modular hyperbolas and exponential curves. Acta Arith. 142, 59–66, 2010.Google Scholar
[10] and , Concentration of points on two and three dimensional modular hyperbolas and applications. Geom. Funct. Anal. 21, 892–904, 2011.Google Scholar
[11] and , Concentration of points on curves in finite fields. Monatsh. Math. 171, 315–327, 2013.Google Scholar
[12] and , An exponential congruence with solutions in primitive roots. Rev. Roum. Math.Pures Appl. 44, 15–22, 1999.Google Scholar
[13] , and , Efficient pseudorandom generators based on the DDH assumption. Public Key Cryptography, PKC 2007. Lecture Notes in Computer Science, volume 4450, pp. 426–441. Springer-Verlag, Berlin, 2007.
[14] , Mathematical Constants. Encyclopedia of Mathematics and its Applications, volume 94. Cambridge University Press, Cambridge, 2003.
[15] and , On the distribution of the power generator. Math. Comp. 70, 1575–1589, 2001.Google Scholar
[16] , An improved pseudo-random generator based on discrete logarithm problem. J. Cryptol. 18, 91–110, 2006.Google Scholar
[18] and , Short cycles in repeated exponentiation modulo aprime. Des. Codes Cryptogr. 56, 35–42, 2010.Google Scholar
[19] and , On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptol. 16, 71–93, 2003.
[20] , Du domaine d'analyse combinatoire. Bull. Acad. Sci. USSR Ser. Mat. (Izv. Akad. Nauk SSSR), 8, 3–48, 1944.Google Scholar
[21] , Fixed points and two cycles of the discrete logarithm. Algorithmic Number Theory. Lecture Notes in Computer Science, volume 2369, pp. 405–416. Springer, Berlin, 2002.
[22] and , New conjectures and results for small cycles of the discrete logarithm. High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams. Fields Institute Communications, volume 41, pp. 245–254. American Mathematical Society, Providence, RI, 2004.
[23] and , Some heuristics and and results for small cycles of the discrete logarithm. Math. Comp. 75, 419–449, 2006.Google Scholar
[24] and , Counting fixed points, two-cycles, and collisions of the discrete exponential functions using p-adic methods. J. Aust. Math. Soc. 92, 163–178, 2012.Google Scholar
[25] and , Analysis of a simple factorization algorithm. Theor. Comput. Sci. 3, 321–348, 1976.Google Scholar
[26] , Pseudorandom number generators in cryptography and number theory. Proc. Symp. Applied Mathematics, volume 42, pp. 115–143. American Mathematical Society, Providence, RI, 1990.
[27] , and , Fixed points for discrete logarithms. Algorithmic Number Theory. Lecture Notes in Computer Science, volume 6197, pp. 6–15. Springer-Verlag, Berlin, 2010.
[28] and , An efficient discrete log pseudo random generator. Advances in Cryptography. Lecture Notes in Computer Science, volume 1462, pp. 35–44. Springer-Verlag, Berlin, 1999.
[29] and , Ordered cycle lengths in a random permutation. Trans. Am. Math. Soc. 121, 340–357, 1966.Google Scholar
[30] , and , More efficient DDH pseudorandom generators. Des. Codes Cryptogr. 55, 45–64, 2010.Google Scholar
[31] , On a problem of Brizolis (Chinese). Pure Appl. Math. 11 (suppl. 1–3).
- 1
- Cited by