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 135–136
DOI: https://doi.org/10.17223/2226308X/13/40 (Mi pdma520) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Computational methods in discrete mathematics

A compact translator of algorithms into Boolean formulas for use in cryptanalysis

D. A. Sofronovaab, K. V. Kalginacd

a Novosibirsk State University
b JetBrains Research
c Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk
d Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (335 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/13/40
Abstract: The program for converting the description of the cryptographic task to CNF is presented. A SAT solver establishes the truth of the formula and finds the values of the variables after that. Features of this development are universality, a small code size (300 lines of C++), easily modifiable and extensible implementation.
Keywords: cryptanalysis, SAT-solver, guess-and-determine attack.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 075-15-2019-1613
Document Type: Article
UDC: 519.7
Language: Russian
Citation: D. A. Sofronova, K. V. Kalgin, “A compact translator of algorithms into Boolean formulas for use in cryptanalysis”, Prikl. Diskr. Mat. Suppl., 2020, no. 13, 135–136
Citation in format AMSBIB
\Bibitem{SofKal20}
\by D.~A.~Sofronova, K.~V.~Kalgin
\paper A compact translator of algorithms into Boolean formulas for use in cryptanalysis
\jour Prikl. Diskr. Mat. Suppl.
\yr 2020
\issue 13
\pages 135--136
\mathnet{http://mi.mathnet.ru/pdma520}
\crossref{https://doi.org/10.17223/2226308X/13/40}
Linking options:
  • https://www.mathnet.ru/eng/pdma520
  • https://www.mathnet.ru/eng/pdma/y2020/i13/p135
    • This publication is cited in the following 1 articles:
    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:94
    Full-text PDF :50
    References:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024