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


Prikl. Diskr. Mat. Suppl., 2017, Issue 10, Pages 102–104 (Mi pdma325)  

This article is cited in 2 scientific papers (total in 2 papers)

Mathematical Methods of Cryptography

S-boxes algorithmic realization based on modified additive generators

V. M. Fomichevabcd, D. M. Lolicha, A. V. Yuzbashevb

a Financial University under the Government of the Russian Federation, Moscow
b National Engineering Physics Institute "MEPhI", Moscow
c Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow
d "Security Code", Moscow

Abstract: $S$-boxes give the properties of non-linearity and diffusion to cryptosystems and are essential parts of symmetric iterative block ciphers. Usually, they are described as vector Boolean functions and are represented by a memory-consuming tables limiting the practical size of them ($6\times4$ bits in DES cypher, $4\times4$ bits in GOST cypher, $8\times8$ bits in Kuznyechik cypher).
In this paper, we present an algorithm for constructing $s$-boxes (including large ones) using modified additive generators (MAG). The required cryptographic properties of the created substitutions follow from algebraic and mixing properties of MAG and are determined in experiments with a software implementation of the algorithm. Each created substitution $s$ on $V_n$ is tested to determine whether it has the following desirable properties: 1) essential dependence of coordinate functions of $s$ on all their variables; 2) non-linearity of all the non-zero combinations of the coordinate functions of $s$; 3) nearness of the difference characteristics $p_s$ to a random value, where $p_s=\max_{\alpha,\beta\in V_8}|\{x\in V_8\colon s(x)\oplus s(x\oplus\alpha)=\beta\}|$. As a result of the research, $2^{19}$ $s$-boxes $8\times8$ were created using MAG with several selected $s$-boxes $4\times4$. Almost all of them satisfy requirements 1 and 2. For a large number (several thousands) of constructed $s$-boxes $8\times8$, $p_s=10/256$, and four $s$-boxes have $p_s=8/256$. The results show that the presented method is capable of constructing large and cryptographically strong $s$-boxes.

Keywords: modified additive generator, MAG, s-box, shift register.

Funding Agency Grant Number
Russian Foundation for Basic Research 16-01-00226


DOI: https://doi.org/10.17223/2226308X/10/41

Full text: PDF file (532 kB)
References: PDF file   HTML file

UDC: 519.1

Citation: V. M. Fomichev, D. M. Lolich, A. V. Yuzbashev, “S-boxes algorithmic realization based on modified additive generators”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 102–104

Citation in format AMSBIB
\Bibitem{FomLolYuz17}
\by V.~M.~Fomichev, D.~M.~Lolich, A.~V.~Yuzbashev
\paper S-boxes algorithmic realization based on modified additive generators
\jour Prikl. Diskr. Mat. Suppl.
\yr 2017
\issue 10
\pages 102--104
\mathnet{http://mi.mathnet.ru/pdma325}
\crossref{https://doi.org/10.17223/2226308X/10/41}


Linking options:
  • http://mi.mathnet.ru/eng/pdma325
  • http://mi.mathnet.ru/eng/pdma/y2017/i10/p102

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. M. Bobrov, S. M. Komissarov, “O svoistvakh dvukh klassov s-boksov razmera $16\times16$”, PDM. Prilozhenie, 2018, no. 11, 57–61  mathnet  crossref
    2. S. M. Komissarov, “Ob algoritmicheskoi realizatsii s-boksov $16\times16$ so strukturami ARX i Babochka”, PDM. Prilozhenie, 2019, no. 12, 101–107  mathnet  crossref
  • Prikladnaya Diskretnaya Matematika. Supplement
    Number of views:
    This page:128
    Full text:33
    References:25

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020