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


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




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

Diskretnaya Matematika, 2017, Volume 29, Issue 4, Pages 3–27
DOI: https://doi.org/10.4213/dm1483 (Mi dm1483) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Generalization of one method of a filter generator key recovery

E. K. Alekseeva, L. A. Kuschinskajab

a Lomonosov Moscow State University
b «KRIPTO-PRO»
Full-text PDF (670 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1483
Abstract: We describe an algorithm extending the previously proposed method of key recovery of a filter generator. The algorithm is based on an approximation of the combining function by algebraically degenerate functions. We give estimates of the computational complexity, reliability, and the amount of memory used by the method. Examples of application of the method are considered, in particular, for the analysis of the LILI-128 cipher.
Keywords: cryptanalysis, key recovery, filter generator, approximation, LILI-128.
Funding agency Grant number
Russian Foundation for Basic Research 16-01-00470 А
Received: 11.07.2016
Revised: 14.11.2017
English version:
Discrete Mathematics and Applications, 2019, Volume 29, Issue 2, Pages 69–87
DOI: https://doi.org/10.1515/dma-2019-0008
Bibliographic databases:
Document Type: Article
UDC: 519.719.2
Language: Russian
Citation: E. K. Alekseev, L. A. Kuschinskaja, “Generalization of one method of a filter generator key recovery”, Diskr. Mat., 29:4 (2017), 3–27; Discrete Math. Appl., 29:2 (2019), 69–87
Citation in format AMSBIB
\Bibitem{AleKus17}
\by E.~K.~Alekseev, L.~A.~Kuschinskaja
\paper Generalization of one method of a filter generator key recovery
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 4
\pages 3--27
\mathnet{http://mi.mathnet.ru/dm1483}
\crossref{https://doi.org/10.4213/dm1483}
\elib{https://elibrary.ru/item.asp?id=30737791}
\transl
\jour Discrete Math. Appl.
\yr 2019
\vol 29
\issue 2
\pages 69--87
\crossref{https://doi.org/10.1515/dma-2019-0008}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000465304800001}
Linking options:
  • https://www.mathnet.ru/eng/dm1483
  • https://doi.org/10.4213/dm1483
  • https://www.mathnet.ru/eng/dm/v29/i4/p3
    • 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:449
    Full-text PDF :101
    References:36
    First page:51
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024