Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2016, Volume 7, Issue 2, Pages 131–142
DOI: https://doi.org/10.4213/mvk191 (Mi mvk191) 		 
Parsimonious models of high-order Markov chains for evaluation of cryptographic generators

Yu. S. Kharin

Belarusian State University, Minsk, Belarus
Full-text PDF (549 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk191
Abstract: Parsimonious (small-parametric) high-order Markov chains determined by a small number of parameters may be used as models of output sequences in cryptographic generators and their blocks. The paper presents methods of statistical identification (parameter estimation and hypotheses testing) by the observed output sequence for Jacobs–Lewis model, Raftery MTD model, Markov chain with partial connections, Markov chain of conditional order.
Key words: cryptograhic generator, output sequence, high-order Markov chain, parsimonious model, statistical identification.
Received 01.III.2015
Bibliographic databases:
Document Type: Article
UDC: 519.671
Language: English
Citation: Yu. S. Kharin, “Parsimonious models of high-order Markov chains for evaluation of cryptographic generators”, Mat. Vopr. Kriptogr., 7:2 (2016), 131–142
Citation in format AMSBIB
\Bibitem{Kha16}
\by Yu.~S.~Kharin
\paper Parsimonious models of high-order Markov chains for evaluation of cryptographic generators
\jour Mat. Vopr. Kriptogr.
\yr 2016
\vol 7
\issue 2
\pages 131--142
\mathnet{http://mi.mathnet.ru/mvk191}
\crossref{https://doi.org/10.4213/mvk191}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3567364}
\elib{https://elibrary.ru/item.asp?id=26475115}
Linking options:
  • https://www.mathnet.ru/eng/mvk191
  • https://doi.org/10.4213/mvk191
  • https://www.mathnet.ru/eng/mvk/v7/i2/p131
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:360
    Full-text PDF :199
    References:64
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024