Searching for efficient cellular automata based keys applied in symmetric key cryptography
Abstract
In this paper we consider a problem of generation by cellular automata of high qualitypseudorandom sequences useful in cryptography. For this purpose one dimensional nonuniformcellular automata is used. The quality of pseudorandom sequences generated by cellular automatadepends on collective behavior of rules assigned to the cellular automata cells. Genetic algorithmis used to find suitable rules from the earlier predefined set of rules. It has been shown that geneticalgorithm eliminates bad subsets of rules and finds subsets of rules, which provide high qualitypseudorandom sequences. These sequences are suitable for symmetric key cryptography and canbe used in different cryptographic modules.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2007.7.1.49-60
Date of publication: 2015-01-04 00:00:00
Date of submission: 2016-04-27 10:31:29
Statistics
Total abstract view - 294
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.