1 publication

• Published Subscription 17 Sep 2022

  Machine Learning for Solving Satisfiability Problems and Applications in Cryptanalysis

  By Sunil Sharma, Rekha Jain

  Abstract: Over the past two decades, we have seen sensational changes within the effectiveness of conflictbased Clause-Learning Boolean Fulfillment (CDCLSAT) solvers on mechanical issues from an assortment of areas. The accessibility of effective general-purpose look devices such as SAT Solver has driven numerous analysts to propose SAT-based strategies for cryptanalysis, such as identifying clashes in hash capacities and breaking symmetric encryption plans. Most of the as of now proposed SAT-based cryptanalysis …

  Published in Research & Reviews: Discrete Mathematical Structures · Vol. 9, Issue 2, 2022 · pp. 28–37 Read article →