A Comparison of the DES and Dömösi Cryptosystems

Abstract

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.