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, 2016, Number 3(33), Pages 16–44
DOI: https://doi.org/10.17223/20710410/33/2
(Mi pdm552)
 

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

Mathematical Methods of Cryptography

From cryptanalysis to cryptographic property of a Boolean function

A. A. Gorodilova

Sobolev Institute of Mathematics, Novosibirsk, Russia
Full-text PDF (810 kB) Citations (8)
References:
Abstract: The survey is devoted to description of basic, but not all, cryptographic properties of Boolean functions: algebraic degree, balancedness and perfect balancedness, avalanche characteristics, non-existence of linear structures, correlation immunity and resiliency, high nonlinearity, statistical independence, algebraic immunity, affinity level and kk-normality, differential uniformity, threshold implementation, multiplicative complexity, high cardinality of linearization sets. The questions about these properties formation are studied based on the attacks on stream and block ciphers that exploit the vulnerabilities of Boolean functions used in ciphers as components. The ideas of such attacks are given. We briefly describe the basic theoretical results obtained for each of the properties and formulate open problems in this area.
Keywords: Boolean function, stream cipher, block cipher, algebraic degree, balancedness, perfect balancedness, avalanche characteristics, linear structure, correlation immunity, resiliency, nonlinearity, statistical independence, algebraic immunity, affinity level, k-normality, differential uniformity, threshold implementation, multiplicative complexity, linearization set, linear complexity, correlation attack, fast correlation attack, linear cryptanalysis, statistical analogue, differential cryptanalysis, side-channel attacks, linearization attack.
Funding agency Grant number
Russian Foundation for Basic Research 15-07-01328
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. A. Gorodilova, “From cryptanalysis to cryptographic property of a Boolean function”, Prikl. Diskr. Mat., 2016, no. 3(33), 16–44
Citation in format AMSBIB
\Bibitem{Gor16}
\by A.~A.~Gorodilova
\paper From cryptanalysis to cryptographic property of a~Boolean function
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 3(33)
\pages 16--44
\mathnet{http://mi.mathnet.ru/pdm552}
\crossref{https://doi.org/10.17223/20710410/33/2}
Linking options:
  • https://www.mathnet.ru/eng/pdm552
  • https://www.mathnet.ru/eng/pdm/y2016/i3/p16
  • This publication is cited in the following 8 articles:
    1. A. R. Belov, “Kharakterizatsiya biektivnykh APN-otobrazhenii v terminakh rasstoyaniya mezhdu podgruppami simmetricheskoi gruppy”, PDM, 2023, no. 60, 5–12  mathnet  crossref
    2. D. A. Zyubina, N. N. Tokareva, “$\mathrm{S}$-bloki spetsialnogo vida ot malogo chisla peremennykh”, Diskretn. analiz i issled. oper., 30:2 (2023), 67–80  mathnet  crossref
    3. T. A. Bonich, M. A. Panferov, N. N. Tokareva, “On the number of $\ell$-suitable Boolean functions in constructions of filter and combining models of stream ciphers”, PDM, 2023, no. 62, 21–28  mathnet  crossref
    4. D. A. Zyubina, N. N. Tokareva, “S-Blocks of Special Type with Few Variables”, J. Appl. Ind. Math., 17:2 (2023), 451  crossref
    5. Alexandr Alexandrovich Kuznetsov, Oleksandr Volodymyrovych Potii, Nikolay Alexandrovich Poluyanenko, Yurii Ivanovich Gorbenko, Natalia Kryvinska, Studies in Systems, Decision and Control, 375, Stream Ciphers in Modern Real-time IT Systems, 2022, 295  crossref
    6. Alexandr Alexandrovich Kuznetsov, Oleksandr Volodymyrovych Potii, Nikolay Alexandrovich Poluyanenko, Yurii Ivanovich Gorbenko, Natalia Kryvinska, Studies in Systems, Decision and Control, 375, Stream Ciphers in Modern Real-time IT Systems, 2022, 419  crossref
    7. K. L. Geut, S. S. Titov, “O blokirovke dvumernykh affinnykh mnogoobrazii”, PDM. Prilozhenie, 2019, no. 12, 7–10  mathnet  crossref  elib
    8. A. V. Miloserdov, “Permutation binomial functions over finite fields”, J. Appl. Industr. Math., 12:4 (2018), 694–705  mathnet  crossref  crossref  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:1036
    Full-text PDF :1455
    References:70
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025