Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-06-15T15:30:32.471Z Has data issue: false hasContentIssue false

11 - Periodic structure of the exponential pseudorandom number generator

Published online by Cambridge University Press:  18 December 2014

Jonas Kaszián
Affiliation:
RWTH Aachen, Aachen
Pieter Moree
Affiliation:
Max-Planck-Institut für Mathematik, Bonn
Igor E. Shparlinski
Affiliation:
University of New South Wales, Sydney
Gerhard Larcher
Affiliation:
Johannes Kepler Universität Linz
Friedrich Pillichshammer
Affiliation:
Johannes Kepler Universität Linz
Arne Winterhof
Affiliation:
Austrian Academy of Sciences, Linz
Chaoping Xing
Affiliation:
Nanyang Technological University, Singapore
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] R., Arratia, A. D., Barbour and S., Tavaré, Logarithmic Combinatorial Structures: A Probabilistic Approach. EMS Monographs in Mathematics. European Mathematical Society, Zürich, 2003.
[2] J., Bourgain, N., Katz and T., Tao, A sum product estimate in finite fields and applications. Geom. Funct. Anal. 14, 27–57, 2004.Google Scholar
[3] J., Bourgain, S. V., Konyagin and I. E., Shparlinski, 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] J., Bourgain, S. V., Konyagin and I. E., Shparlinski, Distribution of elements of cosets of small subgroups and applications. Int. Math. Res. Notices 2012, 1968–2009, 2012.Google Scholar
[5] J., Bourgain, M. Z., Garaev, S. V., Konyagin and I. E., Shparlinski, On congruences with products of variables from short intervals and applications. Proc. Steklov Math. Inst. 280, 67–96, 2013.Google Scholar
[6] J., Bourgain, M. Z., Garaev, S. V., Konyagin and I. E., Shparlinski, Multiplicative congruences with variables from short intervals. J. Anal. Math., to appear.
[7] N. G. de, Bruijn, 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] B., Bukh and J., Tsimerman, Sum-product estimates for rational functions. Proc. London Math. Soc. 104, 1–26, 2012.Google Scholar
[9] T. H., Chan and I. E., Shparlinski, On the concentration of points on modular hyperbolas and exponential curves. Acta Arith. 142, 59–66, 2010.Google Scholar
[10] J., Cilleruelo and M. Z., Garaev, Concentration of points on two and three dimensional modular hyperbolas and applications. Geom. Funct. Anal. 21, 892–904, 2011.Google Scholar
[11] J., Cilleruelo and I. E., Shparlinski, Concentration of points on curves in finite fields. Monatsh. Math. 171, 315–327, 2013.Google Scholar
[12] C., Cobeli and A., Zaharescu, An exponential congruence with solutions in primitive roots. Rev. Roum. Math.Pures Appl. 44, 15–22, 1999.Google Scholar
[13] R. R., Farashahi, B., Schoenmakers and A., Sidorenko, 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] S. R., Finch, Mathematical Constants. Encyclopedia of Mathematics and its Applications, volume 94. Cambridge University Press, Cambridge, 2003.
[15] J. B., Friedlander and I. E., Shparlinski, On the distribution of the power generator. Math. Comp. 70, 1575–1589, 2001.Google Scholar
[16] R., Gennaro, An improved pseudo-random generator based on discrete logarithm problem. J. Cryptol. 18, 91–110, 2006.Google Scholar
[17] L., Glebsky, Cycles in repeated exponentiation modulo pn. Integers 13, A66, 2013.Google Scholar
[18] L., Glebsky and I. E., Shparlinski, Short cycles in repeated exponentiation modulo aprime. Des. Codes Cryptogr. 56, 35–42, 2010.Google Scholar
[19] O., Goldreich and V., Rosen, On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptol. 16, 71–93, 2003.
[20] V., Goncharov, Du domaine d'analyse combinatoire. Bull. Acad. Sci. USSR Ser. Mat. (Izv. Akad. Nauk SSSR), 8, 3–48, 1944.Google Scholar
[21] J., Holden, 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] J., Holden and P., Moree, 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] J., Holden and P., Moree, Some heuristics and and results for small cycles of the discrete logarithm. Math. Comp. 75, 419–449, 2006.Google Scholar
[24] J., Holden and M. M., Robinson, 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] D. E., Knuth and L. Trabb, Pardo, Analysis of a simple factorization algorithm. Theor. Comput. Sci. 3, 321–348, 1976.Google Scholar
[26] J. C., Lagarias, Pseudorandom number generators in cryptography and number theory. Proc. Symp. Applied Mathematics, volume 42, pp. 115–143. American Mathematical Society, Providence, RI, 1990.
[27] M., Levin, C., Pomerance and K., Soundararajan, Fixed points for discrete logarithms. Algorithmic Number Theory. Lecture Notes in Computer Science, volume 6197, pp. 6–15. Springer-Verlag, Berlin, 2010.
[28] S., Patel and G. S., Sundaram, 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] L. A., Shepp and S. P., Lloyd, Ordered cycle lengths in a random permutation. Trans. Am. Math. Soc. 121, 340–357, 1966.Google Scholar
[30] H., Shi, S., Jiang and Z., Qin, More efficient DDH pseudorandom generators. Des. Codes Cryptogr. 55, 45–64, 2010.Google Scholar
[31] W. P., Zhang, On a problem of Brizolis (Chinese). Pure Appl. Math. 11 (suppl. 1–3).

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×