Problems in theory of cryptanalytical invertibility of finite automata

Эндаумент фонд ТГУ!
Впиши своё имя в историю университета
- Сделать пожертвование -

Add to "Quick Collection"

Description	Size	Format
Problems in theory of cryptanalytical invertibility of finite automata	2 MB	Adobe Acrobat PDF	Read	Download
DOI Доступ к ресурсу на сайте издателя			10.17223/20710410/50/4

Title: Problems in theory of cryptanalytical invertibility of finite automata
Creator: Agibalov, G. P.
Date: 2020
DOI: 10.17223/20710410/50/4
Description: 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 cryptana- lytically 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 + т 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.

Relationships: Show Relationship Browser for this Object
collection(s): Институт прикладной математики и компьютерных наук (c 01.09.2017 г.) | Журналы ТГУ
Identifier: смотреть в электронном каталоге НБ ТГУ
Type: статьи в журналах
Source: Прикладная дискретная математика. 2020. № 50. С. 62-71
Language: eng

Created: 23-12-2020

766 Visitors

563 Hits

226 Downloads

Журналы ТГУ Problems in theory of cryptanalytical invertibility of finite automata