Skip to main content

On the Lattice Structure of Inversive PRNG via the Additive Order

  • Conference paper
  • First Online:
  • 694 Accesses

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

Abstract

One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorandom sequences theory. In this article, we improve on a bound on one of the pseudorandom number generators (PRNGs) proposed by Harald Niederreiter and Arne Winterhof and study its lattice structure. We obtain that this generator passes general lattice tests for arbitrary lags for high dimensions.

Dedicated to Harald Niederreiter on the occasion of his 70th birthday.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    If \(j=0\), we will denote \(d_0=0\), although the lags are \(d_1,\ldots , d_{L-1}\).

  2. 2.

    Because we always consider \(w_{i,1}=0\). It is also equivalent to discard \(x_1\), i. e. working in \(\mathbb {R}^{r-1}\).

References

  1. Chen, Z.: Finite binary sequences constructed by explicit inversive methods. Finite Fields Appl. 14(3), 579–592 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen, Z., Gomez, D., Winterhof, A.: Distribution of digital explicit inversive pseudorandom numbers and their binary threshold sequence. In: Carlo, M., Carlo, Q.-M. (eds.) Methods 2008, pp. 249–258. Springer, Heidelberg (2009)

    Google Scholar 

  3. Edelsbrunner, H.: Algorithms in Combinatorial Geometry, vol. 10. Springer, New York (1987)

    Book  MATH  Google Scholar 

  4. Gomez-Perez, D., Gutierrez, J.: On the linear complexity and lattice test of nonlinear pseudorandom number generators (2013)

    Google Scholar 

  5. Hu, H., Gong, G.: A study on the pseudorandom properties of sequences generated via the additive order. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds.) SETA 2008. LNCS, vol. 5203, pp. 51–59. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Meidl, W., Winterhof, A.: On the linear complexity profile of explicit nonlinear pseudorandom numbers. Inf. Process. Lett. 85(1), 13–18 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo methods, vol. 63. SIAM, Philadelphia (1992)

    Book  MATH  Google Scholar 

  8. Niederreiter, H., Shparlinski, I.E.: Recent advances in the theory of nonlinear pseudorandom number generators. In: Carlo, M., Carlo, Q.-M. (eds.) Methods 2000, pp. 86–102. Springer, Heidelberg (2002)

    Google Scholar 

  9. Niederreiter, H., Shparlinski, I.E.: Dynamical systems generated by rational functions. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 6–17. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Niederreiter, H., Winterhof, A.: Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators. Acta Arithmetica 93(4), 387–399 (2001)

    MathSciNet  Google Scholar 

  11. Niederreiter, H., Winterhof, A.: On a new class of inversive pseudorandom numbers for parallelized simulation methods. Periodica Mathematica Hungarica 42(1), 77–87 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. Niederreiter, H., Winterhof, A.: On the lattice structure of pseudorandom numbers generated over arbitrary finite fields. Appl. Algebra Eng. Commun. Comput. 12(3), 265–272 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Niederreiter, H., Winterhof, A.: On the structure of inversive pseudorandom number generators. In: Boztaş, S., Lu, H.-F.F. (eds.) AAECC 2007. LNCS, vol. 4851, pp. 208–216. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Pirsic, G., Winterhof, A.: On the structure of digital explicit nonlinear and inversive pseudorandom number generators. J. Complex. 26(1), 43–50 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sleumer, N.H.: Hyperplane arrangements: Construction, visualization and applications. Master’s thesis, Swiss Federal Institute of Technology (2000)

    Google Scholar 

  16. Topuzoğlu, A., Winterhof, A.: Pseudorandom sequences. In: Topics in Geometry. Coding Theory and Cryptography, vol. 6, pp. 135–166. Springer, Dordrecht (2007)

    Google Scholar 

  17. Winterhof, A.: Recent results on recursive nonlinear pseudorandom number generators. In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 113–124. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Acknowledgement

This work is supported in part by the Spanish Ministry of Science, project MTM2011-24678.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Domingo Gómez-Pérez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gómez-Pérez, D., Gómez, A. (2014). On the Lattice Structure of Inversive PRNG via the Additive Order. In: Schmidt, KU., Winterhof, A. (eds) Sequences and Their Applications - SETA 2014. SETA 2014. Lecture Notes in Computer Science(), vol 8865. Springer, Cham. https://doi.org/10.1007/978-3-319-12325-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12325-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12324-0

  • Online ISBN: 978-3-319-12325-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics