Pseudorandom vector sequences derived from triangular polynomial systems with constant multipliers

Alina Ostafe*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

8 Citations (Scopus)

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 V is an element of F(p)(m) on the discrepancy for pseudorandom vectors generated by these iterations.

Original languageEnglish
Title of host publicationArithmetic of finite fields
Subtitle of host publicationthird international workshop, WAIFI 2010, proceedings
EditorsM. Anwar Hasan, Tor Helleseth
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Pages62-72
Number of pages11
ISBN (Print)9783642137969
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event3rd International Workshop on Arithmetic of Finite Fields - Istanbul, Turkey
Duration: 27 Jun 201030 Jun 2010

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume6087
ISSN (Print)0302-9743

Conference

Conference3rd International Workshop on Arithmetic of Finite Fields
CountryTurkey
CityIstanbul
Period27/06/1030/06/10

Keywords

  • Nonlinear pseudorandom number generators
  • triangular polynomial systems
  • exponential sums
  • discrepancy
  • NUMBERS

Cite this