Cryptanalytical finite automaton invertibility with finite delay
The paper continues an investigation of the cryptanalytical invertibility concept with a finite delay introduced by the author for finite automata. Here, we expound an algorithmic test for an automaton A to be cryptanalytically invertible with a finite delay, that is, to have a recovering function f...
| Published in: | Прикладная дискретная математика № 46. С. 27-37 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000707771 Перейти в каталог НБ ТГУ |
| LEADER | 02364nab a2200325 c 4500 | ||
|---|---|---|---|
| 001 | vtls000707771 | ||
| 003 | RU-ToGU | ||
| 005 | 20230319220411.0 | ||
| 007 | cr | | ||
| 008 | 200311|2019 ru s a eng d | ||
| 024 | 7 | |a 10.17223/20710410/46/3 |2 doi | |
| 035 | |a to000707771 | ||
| 039 | 9 | |a 202003171342 |c 202003171342 |d cat34 |c 202003111109 |d VLOAD |y 202003111057 |z Александр Эльверович Гилязов | |
| 040 | |a RU-ToGU |b rus |c RU-ToGU | ||
| 100 | 1 | |a Agibalov, G. P. |d 1939-2020 |9 97262 | |
| 245 | 1 | 0 | |a Cryptanalytical finite automaton invertibility with finite delay |c G. P. Agibalov |
| 504 | |a Библиогр.: 5 назв. | ||
| 520 | 3 | |a The paper continues an investigation of the cryptanalytical invertibility concept with a finite delay introduced by the author for finite automata. Here, we expound an algorithmic test for an automaton A to be cryptanalytically invertible with a finite delay, 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 defining a type of its invertibility and known to cryptanalysts. The test finds out whether the automaton A has a recovering function f or not and if it has, determines some or, may be, all of such functions. The test algorithm simulates a backtracking method for searching a possibility to transform a binary relation to a function by shortening its domain to a set corresponding to the invertibility type under consideration. | |
| 653 | |a конечные автоматы | ||
| 653 | |a обратимость конечных автоматов | ||
| 653 | |a автоматы без потери информации | ||
| 653 | |a криптоаналитическая обратимость | ||
| 653 | |a обратимость автоматов | ||
| 655 | 4 | |a статьи в журналах |9 879358 | |
| 773 | 0 | |t Прикладная дискретная математика |d 2019 |g № 46. С. 27-37 |x 2071-0410 |w 0210-48760 | |
| 852 | 4 | |a RU-ToGU | |
| 856 | 4 | |u http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000707771 | |
| 856 | |y Перейти в каталог НБ ТГУ |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=465249 | ||
| 908 | |a статья | ||
| 999 | |c 465249 |d 465249 | ||