Graphic cryptography with pseudorandom bit generators and cellular automata

17Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose a new graphic symmetrical cryptosystem in order to encrypt a colored image defined by pixels and by any number of colors. This cryptosystem is based on a reversible bidimensional cellular automaton and uses a pseudorandom bit generator. As the key of the cryptosystem is the seed of the pseudorandom bit generator, the latter has to be cryptographically secure. Moreover, the recovered image from the ciphered image has not loss of resolution and the ratio between the ciphered image and the original one, i.e., the factor expansion of the cryptosystem, is 1.

Cite

CITATION STYLE

APA

Marañón, G. Á., Encinas, L. H., Encinas, A. H., Del Rey, Á. M., & Sánchez, G. R. (2003). Graphic cryptography with pseudorandom bit generators and cellular automata. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2773 PART 1, pp. 1207–1214). Springer Verlag. https://doi.org/10.1007/978-3-540-45224-9_163

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free