Secret key specification for a variable-length cryptographic cellular automata model

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

Abstract

Reverse algorithm was previously evaluated as encryption method concluding that its simple adoption is unviable, since it does not assurance the pre-image existence. Variable-Length Encryption Method (VLE) was proposed where a alternative algorithm with extra bits is adopted when pre-image computation is not possible. If an adequate secret key is used with VLE it is expected that the final ciphertext length is close to plaintext size. Several CA static parameters were calculated for a set formed by all radius 2 right-toggle rules. A database was generated associating rules performance in VLE ciphering with its parameters. A genetic algorithm-based data mining was performed to discover an adequate key specification based on CA parameters. Using such specification, ciphertext length is short, encryption process returns high entropy and VLE has a good protection against differential cryptanalysis. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Oliveira, G. M. B., Martins, L. G. A., Ferreira, G. B., & Alt, L. S. (2010). Secret key specification for a variable-length cryptographic cellular automata model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6239 LNCS, pp. 381–390). https://doi.org/10.1007/978-3-642-15871-1_39

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