Combinatorics-algebraic models in cryptography
Prikladnaâ diskretnaâ matematika, no. 11 (2009), pp. 74-114
Voir la notice de l'article provenant de la source Math-Net.Ru
These lectures are devoted to the characterization of descriptive, algorithmic and metric applied aspects of combinatorics-algebraic models for investigation of modern cryptography problems. Some basic ways for
application of chaotic dynamics models and methods are presented. Linear and non-linear automata described by systems of equations over the ring $\mathbf Z_{p^k}$ are characterized. Some subsets of invertible automata for design of symmetric stream ciphers are considered.
@article{PDM_2009_11_a3,
author = {V. G. Skobelev},
title = {Combinatorics-algebraic models in cryptography},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {74--114},
publisher = {mathdoc},
number = {11},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_11_a3/}
}
V. G. Skobelev. Combinatorics-algebraic models in cryptography. Prikladnaâ diskretnaâ matematika, no. 11 (2009), pp. 74-114. http://geodesic.mathdoc.fr/item/PDM_2009_11_a3/