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, 2022, Number 58, Pages 40–56
DOI: https://doi.org/10.17223/20710410/58/5
(Mi pdm784)
 

Mathematical Methods of Cryptography

Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability

A. A. Dmukh, D. O. Pasko

Academy of Cryptography of the Russian Federation, Moscow, Russia
References:
Abstract: In this paper, we describe a “differential meet-in-the-middle” method for obtaining differences for $64$-bit ARX permutation Alzette with maximum or close to maximum differential characteristic probability (DCP). The method is based on testing the high-probability differences in the middle rounds of Alzette and extending them to the previous and following rounds. Using this method, we obtain $7$ differences for $4$-rounds Alzette with DCP $2^{-6}$, $1$ difference for $5$-rounds Alzette with DCP $2^{-10}$, and $1$ difference for $6$-rounds Alzette with DCP $2^{-18}$. Same differences for $4$ and $5$ rounds were obtained by the developers of Alzette as the differences with maximum DCP, but our method has lower complexity: taking the calculation of probability for a round difference as a single operation, it's $36$ operations ($4$ rounds), $135$ operations ($5$ rounds) and $486$ operations ($6$ rounds) for our method and more than $1.29\cdot 10^8$ operations ($4$ rounds), $2\cdot 1.29\cdot 10^8$ operations ($5$ rounds) and $1.03\cdot 10^{14}$ operations ($6$ rounds) for Alzette developers’ method. Also, we obtain $6$ differences for $7$-rounds Alzette with DCP $2^{-27}$ and $11$ differences for $8$-rounds Alzette with DCP $2^{-35}$ with complexity $\le 5\cdot 10^{13}$ operations for both cases. For these number of rounds by the developers of Alzette were obtained only the higher bounds for maximum DCP: $2^{-24}$ ($7$ rounds) and $2^{-32}$ ($8$ rounds). Our estimations of Alzette developers’ method complexity is $\ge2.97\cdot 10^{16}$ operations for $7$-rounds Alzette and $\ge2.97\cdot 10^{16} + 4.75\cdot 10^{12}$ operations for $8$-rounds Alzette.
Keywords: permutation, Alzette, differential characteristic, differential method.
Document Type: Article
UDC: 003.26.09+004.021
Language: Russian
Citation: A. A. Dmukh, D. O. Pasko, “Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability”, Prikl. Diskr. Mat., 2022, no. 58, 40–56
Citation in format AMSBIB
\Bibitem{DmuPas22}
\by A.~A.~Dmukh, D.~O.~Pasko
\paper Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability
\jour Prikl. Diskr. Mat.
\yr 2022
\issue 58
\pages 40--56
\mathnet{http://mi.mathnet.ru/pdm784}
\crossref{https://doi.org/10.17223/20710410/58/5}
Linking options:
  • https://www.mathnet.ru/eng/pdm784
  • https://www.mathnet.ru/eng/pdm/y2022/i4/p40
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:94
    Full-text PDF :49
    References:24
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024