Autor según el artículo: Mecsei, Zoltan Pal

Palabras clave: lnguage

Resumen: In this paper we compare the well known DES cryptosystem with the recently introduced Dömösi system, which is based on nite automata. We do a time complexity analysis on both algrithms. We show that without making use of an auxiliary matrix the Dömösi cryptosystem is slower than DES. However, the use of auxiliary matrices makes the former perform better than its well known counterpart for some block lengths.

Año de publicación de la revista: 2012

Tipo de publicación: info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article