Random Graph Construction for Cryptographic Applications
The author in a number of his previous papers proposed methods to construct symmetric cryptographic algorithms based on the generalized cellular automata. To possess good cryptographic properties, graphs of such automata must meet a number of requirements. To construct such graphs both the determini...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
MGTU im. N.È. Baumana
2017-07-01
|
| Series: | Matematika i Matematičeskoe Modelirovanie |
| Subjects: | |
| Online Access: | https://www.mathmelpub.ru/jour/article/view/76 |