Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2020, Number 50, Pages 62–71
DOI: https://doi.org/10.17223/20710410/50/4
(Mi pdm722)
 

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
Full-text PDF (640 kB) Citations (2)
References:
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.
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: English
Citation: G. P. Agibalov, “Problems in theory of cryptanalytical invertibility of finite automata”, Prikl. Diskr. Mat., 2020, no. 50, 62–71
Citation in format AMSBIB
\Bibitem{Agi20}
\by G.~P.~Agibalov
\paper Problems in theory of cryptanalytical invertibility of finite automata
\jour Prikl. Diskr. Mat.
\yr 2020
\issue 50
\pages 62--71
\mathnet{http://mi.mathnet.ru/pdm722}
\crossref{https://doi.org/10.17223/20710410/50/4}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000602688300004}
Linking options:
  • https://www.mathnet.ru/eng/pdm722
  • https://www.mathnet.ru/eng/pdm/y2020/i4/p62
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:98
    Full-text PDF :51
    References:13
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024