English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we investigate the strength of six different SAT solvers inattacking various obfuscation schemes. Our investigation revealed that Glucoseand Lingeling SAT solvers are generally suited for attacking small-to-midsizeobfuscated circuits, while the MapleGlucose, if the system is not memory bound,is best suited for attacking mid-to-difficult obfuscation methods. Ourexperimental result indicates that when dealing with extremely large circuitsand very difficult obfuscation problems, the SAT solver may be memory bound,and Lingeling, for having the most memory efficient implementation, is thebest-suited solver for such problems. Additionally, our investigation revealedthat SAT solver execution times may vary widely across different SAT solvers.Hence, when testing the hardness of an obfuscation method, although theincrease in difficulty could be verified by one SAT solver, the pace ofincrease in difficulty is dependent on the choice of a SAT solver.

Benchmarking the Capabilities and Limitations of SAT Solvers in Defeating Obfuscation Schemes