In previous works we have made the integration of one-dimensional linear cellular automata into bit-stream ciphers.
These automata present a high degree of confusion-diffusion information and reasonable entropy levels. Our purpose is to obtain one-time pad ciphers to use in mobile communications.
Cellular automaton number 30 is tested and validated to code the cipher. This work shows how to parallelize our encryption algorithm using Subramanian's equation to distribute the computational effort over a multicore CPU. Several standard multicore platforms will be used to verify performance gain
© 2001-2024 Fundación Dialnet · Todos los derechos reservados