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...

Full description

Bibliographic Details
Main Authors: Aleksey I. Pakhomchik, Vladimir V. Voloshinov, Valerii M. Vinokur, Gordey B. Lesovik
Format: Article
Language:English
Published: MDPI AG 2022-01-01
Series:Algorithms
Subjects:
constrained programming
quadratic unconstrained binary optimization
hash function
cryptanalysis
Online Access:https://www.mdpi.com/1999-4893/15/2/33

Internet

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

Similar Items