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

Ver/Abrir
Identificadores
URI: http://hdl.handle.net/10902/7949
ISSN: 0025-5718
ISSN: 1088-6842
Compartir
Estadísticas
Ver Estadísticas
Google Scholar
Registro completo
Mostrar el registro completo DC
Autoría
Gómez Pérez, DomingoAutoridad Unican; Ostafe, Alina; Shparlinski, Igor E.
Fecha
2014
Derechos
© American Mathematical Society First published in Mathematics of Computation in 83(287) 2014, published by the American Mathematical Society
Publicado en
Mathematics of Computation Volume 83, Issue 287, May 2014, Pages 1535-1550
Palabras clave
Polynomial iterations
Pseudorandom numbers
Resumen/Abstract
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 pseu-dorandom number generators. We then give several concrete constructions that illustrate the applicability of these general results.
Colecciones a las que pertenece