Pseudorandom Numbers and Hash Functions from Iterations of Multivariate Polynomials

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Dynamical systems generated by iterations of multivariate polynomials with slow degree growth have proved to admit good estimates of exponential sums along their orbits which in turn lead to rather stronger bounds on the discrepancy for pseudorandom vectors generated by these iterations. Here we add new arguments to our original approach and also extend some of our recent constructions and results to more general orbits of polynomial iterations which may involve distinct polynomials as well. Using this construction we design a new class of hash functions from iterations of polynomials and use our estimates to motivate their "mixing" properties.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Pseudorandom Numbers and Hash Functions from Iterations of Multivariate Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pseudorandom Numbers and Hash Functions from Iterations of Multivariate Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudorandom Numbers and Hash Functions from Iterations of Multivariate Polynomials will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-220599

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.