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, 2024, Issue 17, Pages 57–63
DOI: https://doi.org/10.17223/2226308X/17/14
(Mi pdma644)
 

Mathematical Methods of Cryptography

Constructing algebraic attacks on lightweight symmetric ciphers using functions with small number of output bits

K. V. Antonova, A. A. Semenovb, I. V. Otpushchennikovb, A. L. Pavlenkoc

a National Engineering Physics Institute "MEPhI", Moscow
b Matrosov Institute for System Dynamics and Control Theory of Siberian Branch of Russian Academy of Sciences, Irkutsk
c ITMO University
References:
Abstract: We propose a new class of algebraic attacks on lightweight cryptographic functions. The main idea is based on the use of special functions that produce significantly fewer output bits than the original functions specified by the ciphers under consideration (hereafter referred to as standard functions). Examples of similar functions can be found in the so-called cube attacks. The inversion of such special functions is much simpler compared to the inversion of standard ones, but the image of a special function has more than one preimage. To achieve uniqueness, a cloning procedure is proposed: several special functions are constructed for different fragments of the plaintext and a common secret key, and then they are combined into a new function for which the inversion problem has a unique solution. The cloning is performed using the And-Inverter Graphs (AIGs) representing the considered special functions. In addition, we use the well-known AIG minimization algorithms to reduce the size of the resulting representations. The combined application of the mentioned techniques made it possible to construct new algebraic attacks which turned out to be more efficient compared to standard SAT-based attacks for some well-known lightweight stream ciphers with truncated initialization phase.
Keywords: algebraic cryptanalysis, lightweight cryptography, SAT solvers, Boolean schemes.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 121041300065-9
Document Type: Article
UDC: 519.7
Language: Russian
Citation: K. V. Antonov, A. A. Semenov, I. V. Otpushchennikov, A. L. Pavlenko, “Constructing algebraic attacks on lightweight symmetric ciphers using functions with small number of output bits”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 57–63
Citation in format AMSBIB
\Bibitem{AntSemOtp24}
\by K.~V.~Antonov, A.~A.~Semenov, I.~V.~Otpushchennikov, A.~L.~Pavlenko
\paper Constructing algebraic attacks on lightweight symmetric ciphers using functions with small number of output bits
\jour Prikl. Diskr. Mat. Suppl.
\yr 2024
\issue 17
\pages 57--63
\mathnet{http://mi.mathnet.ru/pdma644}
\crossref{https://doi.org/10.17223/2226308X/17/14}
Linking options:
  • https://www.mathnet.ru/eng/pdma644
  • https://www.mathnet.ru/eng/pdma/y2024/i17/p57
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025