Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators

Domingo Gómez-Pérez, Alina Ostafe, Igor Shparlinski

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
8 Downloads (Pure)

Abstract

We present several general results that show how algebraic dynamical systems with a slow degree growth and also rational automorphisms can be used to construct stronger pseudorandom number generators. We then give several concrete constructions that illustrate the applicability of these general results.

Original languageEnglish
Pages (from-to)1535-1550
Number of pages16
JournalMathematics of Computation
Volume83
Issue number287
DOIs
Publication statusPublished - May 2014

Bibliographical note

Copyright 2014 American Mathematical Society. First published in Mathematics of computation, vol. 83, no. 287, published by the American Mathematical Society. The original article can be found at http://doi.org/10.1090/S0025-5718-2013-02780-9

Fingerprint

Dive into the research topics of 'Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators'. Together they form a unique fingerprint.

Cite this