English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/8856
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

On the Sequences generated by 90-150 Programmable Cellular Automata

AutorGuía Martínez, Dolores de la; Peinado Domínguez, Alberto
Palabras claveCryptography
Pseudorandom number generation
Cellular Automata
Fecha de publicaciónjul-2001
EditorInternational Institute of Informatics and Systemics
Institute of Electrical and Electronics Engineers
Citación5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001) ; IS0051301
ResumenThe 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.
Descripción4 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).
URIhttp://hdl.handle.net/10261/8856
ISBN980-07-7529-3
Aparece en las colecciones: (SGAI) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
IS0051301.PDF30,96 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.