UR-215 - Cryptanalysis of Caesar Cipher with Answer Set Programming

Answer Set Programming is an emerging paradigm in logical and declarative programming that finds all possible solutions to a particular logic problem given certain constraints and is widely used in AI for knowledge representation and reasoning. Answer Set Programming has been applied for the cryptanalysis of the Caesar cipher. Using Answer Set Programming, words have been both encrypted and decrypted with the Caesar cipher through AI knowledge representation and reasoning. It is shown that Answer Set Programming is viable for the field of cryptography

SAT Based Attacks on SipHash

SipHash is a proposed pseudorandom function (PRF) that is optimized for small message inputs. It is intended to be used as a message-authentication code (MAC). It uses a 128-bit secret key to compute the tag of a message. This project uses SAT based attacks on the primitive to perform partial key recovery and compares the effectiveness of these attacks against standard brute force approach that involves trying all possible combinations for the key bits. The primitive is converted into CNF and fed to an off-the-shelf SAT solver. The solver uses clause learning and if satisfiable, returns a set of values for the missing key bits. It also reports the number of conflicts that occurred before a solution was found. This is repeated several times for varying number of missing key bits and different versions of SipHash. It is then compared to the number of attempts to retrieve the missing key bits using brute force and the results are analyzed to check the effectiveness of SAT based attacks. iv Contents Abstract......................................

Analysis of L-structure of polyhedron in the partial max sat problem

Исследуется смешанная задача максимальной выполнимости на основе моделей целочисленного линейного программирования и метода регулярных разбиений. Установлена зависимость мощности произвольного L-комплекса многогранника указанной смешанной задачи с мощностью L-комплекса соответствующей задачи выполнимости, использование которой позволяет создавать и анализировать алгоритмы решения смешанной задачи, основанные на методе перебора L-классов