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 129–132
DOI: https://doi.org/10.17223/2226308X/13/38 (Mi pdma518) 		 
Computational methods in discrete mathematics

Construction of cryptographic Boolean functions using SAT-solvers

A. E. Doronina, K. V. Kalginbac

a Novosibirsk State University
b Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk
c Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (625 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/13/38
Abstract: In this paper, we propose a method for solving some cryptographic problems based on translation them into SAT-problems and application of SAT-solvers. We introduce construction of several formulas defining conditions of one-to-one property and differential uniformity of vectorial Boolean functions.
Keywords: SAT-solvers, cryptography, Boolean functions.
Funding agency Grant number
Russian Foundation for Basic Research 18-07-01394_а
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. E. Doronin, K. V. Kalgin, “Construction of cryptographic Boolean functions using SAT-solvers”, Prikl. Diskr. Mat. Suppl., 2020, no. 13, 129–132
Citation in format AMSBIB
\Bibitem{DorKal20}
\by A.~E.~Doronin, K.~V.~Kalgin
\paper Construction of cryptographic Boolean functions using SAT-solvers
\jour Prikl. Diskr. Mat. Suppl.
\yr 2020
\issue 13
\pages 129--132
\mathnet{http://mi.mathnet.ru/pdma518}
\crossref{https://doi.org/10.17223/2226308X/13/38}
Linking options:
  • https://www.mathnet.ru/eng/pdma518
  • https://www.mathnet.ru/eng/pdma/y2020/i13/p129
    • 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:95
    Full-text PDF :47
    References:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024