Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT

05/07/2014
by   Ilya Otpuschennikov, et al.
0

In this paper we present the Transalg system, designed to produce SAT encodings for discrete functions, written as programs in a specific language. Translation of such programs to SAT is based on propositional encoding methods for formal computing models and on the concept of symbolic execution. We used the Transalg system to make SAT encodings for a number of cryptographic functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2018

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

In the present paper we describe the technology for translating algorith...
research
07/04/2016

Encoding Cryptographic Functions to SAT Using Transalg System

In this paper we propose the technology for constructing propositional e...
research
03/08/2000

DES: a Challenge Problem for Nonmonotonic Reasoning Systems

The US Data Encryption Standard, DES for short, is put forward as an int...
research
03/13/2018

On Cryptographic Attacks Using Backdoors for SAT

Propositional satisfiability (SAT) is at the nucleus of state-of-the-art...
research
06/23/2022

A Model-Agnostic SAT-based Approach for Symbolic Explanation Enumeration

In this paper titled A Model-Agnostic SAT-based approach for Symbolic Ex...
research
10/10/2018

A Toolbox For Property Checking From Simulation Using Incremental SAT (Extended Abstract)

We present a tool that primarily supports the ability to check bounded p...
research
04/04/2022

Reducing SAT to Max2XOR

Representing some problems with XOR clauses (parity constraints) can all...

Please sign up or login with your details

Forgot password? Click here to reset