Skip to main content
SpringerLink
Log in

Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers

  • Conference paper
Book cover Arithmetic of Finite Fields (WAIFI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6087))

Included in the following conference series:

Abstract

In this paper we study a new class of dynamical systems generated by iterations of a class of multivariate permutation polynomial systems. Using the same techniques studied previously for other generators, we bound exponential sums along the orbits of these dynamical systems and show that they admit stronger estimates than in the general case and thus can be of use for pseudorandom number generation. We also prove a nontrivial bound “on average” over all initial values \({\rm v} \epsilon \mathbb{F}_p^{m}\) on the discrepancy for pseudorandom vectors generated by these iterations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bourgain, J.: Mordell’s exponential sum estimate revisited. J. Amer. Math. Soc. 18, 477–499 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cusick, T.W., Ding, C., Renvall, A.: Stream ciphers and number theory. Elsevier, Amsterdam (2003)

    Google Scholar 

  3. Drmota, M., Tichy, R.: Sequences, discrepancies and applications. Springer, Berlin (1997)

    MATH  Google Scholar 

  4. Griffin, F., Niederreiter, H., Shparlinski, I.E.: On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 1999. LNCS, vol. 1719, pp. 87–93. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Gutierrez, J., Gomez-Perez, D.: Iterations of multivariate polynomials and discrepancy of pseudorandom numbers. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 192–199. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Kuipers, L., Niederreiter, H.: Uniform distribution of sequences. Wiley-Intersci., New York (1974)

    MATH  Google Scholar 

  7. Lidl, R., Niederreiter, H.: On orthogonal systems and permutation polynomials in several variables. Acta Arith. 22, 257–265 (1973)

    MATH  MathSciNet  Google Scholar 

  8. Lidl, R., Niederreiter, H.: Finite fields. Cambridge Univ. Press, Cambridge (1997)

    Google Scholar 

  9. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  10. Niederreiter, H.: Linear complexity and related complexity measures for sequences. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 1–17. Springer, Heidelberg (2003)

    Google Scholar 

  11. Niederreiter, H.: Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Soc. 84, 957–1041 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  12. Niederreiter, H.: Random number generation and Quasi–Monte Carlo methods. SIAM Press, Philadelphia (1992)

    MATH  Google Scholar 

  13. Niederreiter, H., Shparlinski, I.E.: On the average distribution of inversive pseudorandom numbers. Finite Fields and Their Appl. 8, 491–503 (2002)

    MATH  MathSciNet  Google Scholar 

  14. Ostafe, A.: Multivariate permutation polynomial systems and pseudorandom number generators. Finite Fields and Their Appl. (to appear, 2009)

    Google Scholar 

  15. Ostafe, A., Pelican, E., Shparlinski, I.E.: On pseudorandom numbers from multivariate polynomial systems. Preprint (2010)

    Google Scholar 

  16. Ostafe, A., Shparlinski, I.E.: On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators. Math. Comp. 79, 501–511 (2010)

    Article  MathSciNet  Google Scholar 

  17. Ostafe, A., Shparlinski, I.E.: Pseudorandom numbers and hash functions from iterations of multivariate polynomials. Cryptography and Communications 2, 49–67 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ostafe, A., Shparlinski, I.E., Winterhof, A.: On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences. Adv. Math. Comm. (2010)

    Google Scholar 

  19. Ostafe, A., Shparlinski, I.E., Winterhof, A.: Multiplicative character sums of a class of nonlinear recurrence vector sequences (preprint) (2009)

    Google Scholar 

  20. Shparlinski, I.E.: Bounds for exponential sums with recurrence sequences and their applications. In: Proc. Voronezh State Pedagogical Inst., vol. 197, pp. 74–85 (1978)

    Google Scholar 

  21. Topuzoǧlu, A., Winterhof, A.: Pseudorandom sequences. In: Topics in Geometry, Coding Theory and Cryptography, pp. 135–166. Springer, Berlin (2006)

    Chapter  Google Scholar 

  22. Winterhof, A.: Linear complexity and related complexity measures. In: Selected Topics in Information and Coding Theory, pp. 3–40. World Scientific, Singapore (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Zürich, Winterthurerstrasse 190, CH-8057, Zürich, Switzerland

    Alina Ostafe

Authors
  1. Alina Ostafe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    M. Anwar Hasan

  2. Department of Informatics, HIB, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ostafe, A. (2010). Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers. In: Hasan, M.A., Helleseth, T. (eds) Arithmetic of Finite Fields. WAIFI 2010. Lecture Notes in Computer Science, vol 6087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13797-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13797-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13796-9

  • Online ISBN: 978-3-642-13797-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation