|
This article is cited in 2 scientific papers (total in 2 papers)
Mathematical Methods of Cryptography
Problems in theory of cryptanalytical invertibility of finite automata
G. P. Agibalov National Research Tomsk State University, Tomsk, Russia
Abstract:
The paper continues an investigation of the cryptanalytical invertibility concept of finite automata with a finite delay introduced by the author in his previous papers where he also gave a constructive set theory test for an automaton $A$ to be cryptanalytically invertible, that is, to have a recovering function $f$ which allows to calculate a prefix of a length $m$ in an input sequence of the automaton $A$ by using its output sequence of a length $m+\tau$ and some additional information about $A$ known to cryptanalysts, defining a type of its invertibility and of its recovering functon. Here, we expound a test for that of another kind, namely some logical necessary and sufficient conditions for an automaton $A$ to have or not a recovering function $f$ of a certain type. Results related to specific types of automata invertibility (invertibility tests, inversion algorithms, synthesis of inverse automata and others) are subjects of further researching and publications.
Keywords:
finite automata, information-lossless automata, automata invertibility, recovering function, cryptanalytical invertibility, cryptanalytical invertibility conditions.
Citation:
G. P. Agibalov, “Problems in theory of cryptanalytical invertibility of finite automata”, Prikl. Diskr. Mat., 2020, no. 50, 62–71
Linking options:
https://www.mathnet.ru/eng/pdm722 https://www.mathnet.ru/eng/pdm/y2020/i4/p62
|
Statistics & downloads: |
Abstract page: | 98 | Full-text PDF : | 51 | References: | 13 |
|