Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Artem Pavlenko"'
Publikováno v:
IEEE Access, Vol 11, Pp 120319-120333 (2023)
In this paper we describe a class of cryptographic guess-and-determine attacks which is based on the notion of a linearizing set. A linearizing set-based attack is applied to a system of Multivariate Quadratic equations (MQ) over $GF(2)$ field, which
Externí odkaz:
https://doaj.org/article/802348ddaee44846909b10d0549ea512
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:10353-10361
The paper proposes a probabilistic generalization of the well-known Strong Backdoor Set (SBS) concept applied to the Boolean Satisfiability Problem (SAT). We call a set of Boolean variables B a ρ-backdoor, if for a fraction of at least ρ of possibl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9957dfd28a5aa69daa941c6e368f70fd
https://doi.org/10.1609/aaai.v36i9.21277
https://doi.org/10.1609/aaai.v36i9.21277
Publikováno v:
2022 IEEE Congress on Evolutionary Computation (CEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b073b0254fa0966ebedfcddc444af35
https://doi.org/10.1109/cec55065.2022.9870262
https://doi.org/10.1109/cec55065.2022.9870262
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031116223
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::005ccf4dd135eef624a8b709c8303a08
https://doi.org/10.1007/978-3-031-11623-0_11
https://doi.org/10.1007/978-3-031-11623-0_11
Publikováno v:
GECCO
Algebraic cryptanalysis studies breaking ciphers by solving algebraic equations. Some of the promising approaches use SAT solvers for this purpose. Although the corresponding satisfiability problems are hard, their difficulty can often be lowered by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85f347dab9ab7b73ae27f81f0bff68db
https://doi.org/10.1145/3321707.3321847
https://doi.org/10.1145/3321707.3321847
Publikováno v:
MIPRO
In this study, a framework aimed at implementing pseudo-Boolean optimization algorithms is presented. In this framework, called EvoGuess objective functions are calculated using the Monte Carlo random sampling method. The framework is used to constru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37c9bcafe460d324926a2d6fe2c5d951
https://doi.org/10.23919/mipro.2019.8757214
https://doi.org/10.23919/mipro.2019.8757214
Publikováno v:
Applications of Evolutionary Computation ISBN: 9783030166915
EvoApplications
EvoApplications
In this paper we present the results on applying evolutionary computation techniques to construction of several cryptographic attacks. In particular, SAT-based guess-and-determine attacks studied in the context of algebraic cryptanalysis. Each of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f48a66c4e2e5fcf16c1d2c3a13853e0d
https://doi.org/10.1007/978-3-030-16692-2_16
https://doi.org/10.1007/978-3-030-16692-2_16
Autor:
Artem Pavlenko, Nadiya Pavlenko
Publikováno v:
The 8th International Conference "Transbaltica ‘2013". Selected papers.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8cfe10f231766050c378697893d34a8
https://doi.org/10.3846/transbaltica2013.035
https://doi.org/10.3846/transbaltica2013.035
Publikováno v:
ACM Transactions on Computational Logic; Jul2024, Vol. 25 Issue 3, p1-24, 24p
Autor:
Groß, Sven1 sgross@hs-harz.de, Menzel, Anne2
Publikováno v:
Raumforschung und Raumordnung. Feb2016, Vol. 74 Issue 1, p51-68. 18p.