'Institute of Electrical and Electronics Engineers (IEEE)'
Abstract
4 pages.-- Communication presented at the 5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001, Orlando, Florida, Jul 22-25, 2001).The analysis of the sequences produced by a pseudorandom number generator based on the iterated quadratic function defined over GF(2^n) is considered. Interesting results, such as the upper bound for their lengths, are stated, and different configurations of the same generator are presented as non-suitable for cryptographic uses. The
sequences generated by 3-neighbourhoud Cellular Automata with combinations of rules 90 and 150 are also analyzed, presenting a similar behavior.This work is supported by CICYT (Spain) under grant TEL98-1020, "Infraestructuras de Seguridad en Internet e Intranets. Aplicación a Redes Públicas y Corporativas".Peer reviewe
