2011/09/24 by Elena Villarreal Zapata, Zapata, Elena Villarreal, Francisco Cruz Ordaz Salazar +1
Computer Science · #Cellular Automata and Applications #Computational Complexity (cs.CC) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1109.5282
openalex publication_date 2011/09/24 · openalex created_date 2022/09/03 · openalex updated_date 2026/07/28
For data ciphering a key is usually needed as a base, so it is indispensable\nto have one that is strong and trustworthy, so as to keep others from accessing\nthe ciphered data. This requires a pseudo-random number generator that would\nprovide such a key, so it is proposed to work with cellular automata helped\nalong with \Mathematica to check that the rules and to what level are\nactually pseudo-random. This project centers on the examination of possible\nmathematical rules, analyzing their characteristics in a detailed manner, and\nsubmitting them to a set of randomness tests with the end of knowing which of\nthem will enable us to obtain those pseudo-random numbers that will conform the\nkey for data ciphering.\n