Converting of Boolean Expression to Linear Equations, Inequalities and QUBO Penalties for Cryptanalysis

Converting of Boolean Expression to Linear Equations, Inequalities and QUBO Penalties for Cryptanalysis

There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An alternative is using the generic solvers for mixed-integer linear pr...

Descripció completa

Dades bibliogràfiques
Autors principals: Aleksey I. Pakhomchik, Vladimir V. Voloshinov, Valerii M. Vinokur, Gordey B. Lesovik
Format: Article
Idioma:English
Publicat: MDPI AG 2022-01-01
Col·lecció:Algorithms
Matèries:
constrained programming
quadratic unconstrained binary optimization
hash function
cryptanalysis
Accés en línia:https://www.mdpi.com/1999-4893/15/2/33

Internet

https://www.mdpi.com/1999-4893/15/2/33

Ítems similars