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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Prikladnaya Diskretnaya Matematika. Supplement, 2020, Issue 13, Pages 54–56
DOI: https://doi.org/10.17223/2226308X/13/16
(Mi pdma496)
 

Mathematical Methods of Cryptography

Construction of distinguishers for iterative block ciphers on the base of neural networks

A. A. Perov, A. I. Pestunov

Novosibirsk State University for Economics and Management
References:
Abstract: We present a new machine learning approach for creating distinguishers (or distinguishing attacks) for iterative block ciphers with a variable number of rounds. A main idea of the approach is based, firstly, on the observation that block cipher ciphertexts (if represented as images) have different textures (patterns) depending on the number of rounds and, secondly, on the fact that modern neural networks can classify images with high accuracy. So, we suggest to represent ciphertexts as images and train neural network to recognize them. In such a case, a level of the ciphertexts randomness can be determined by a classification error value. We introduce two methods that can be used for practice: the “etalon-ciphertext” method and the “neighbor-rounds” method. It has been experimentally demonstrated that the “etalon” method is slightly more accurate than the “neighbor-rounds” method, however, it requires an etalon sequence of true-random numbers or, at least, numbers with good statistical properties. At the same time, the second method requires only one cipher. In our experiments, we used the AES256 cipertext as the etalon, however, any other proper random number generator can be used. In both cases, the classification error converges to 50 % when the number of rounds increases. Both methods can also be employed in order to estimate the minimal number of rounds which provides acceptable statistical properties of the ciphertext.
Keywords: block cipher, machine learning, neural network, statistical analysis, distinguishing attack.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. A. Perov, A. I. Pestunov, “Construction of distinguishers for iterative block ciphers on the base of neural networks”, Prikl. Diskr. Mat. Suppl., 2020, no. 13, 54–56
Citation in format AMSBIB
\Bibitem{PerPes20}
\by A.~A.~Perov, A.~I.~Pestunov
\paper Construction of distinguishers for iterative block ciphers on the base of neural networks
\jour Prikl. Diskr. Mat. Suppl.
\yr 2020
\issue 13
\pages 54--56
\mathnet{http://mi.mathnet.ru/pdma496}
\crossref{https://doi.org/10.17223/2226308X/13/16}
Linking options:
  • https://www.mathnet.ru/eng/pdma496
  • https://www.mathnet.ru/eng/pdma/y2020/i13/p54
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:107
    Full-text PDF :68
    References:17
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024