Encoding Hash Functions as a SAT Problem

The SATisfiability Problem is a core problem in mathematical logic and computing theory. In the last years, progresses have led it to be a great and competitive approach to practically solve a wide range of industrial and academic problems. Thus, the current SAT solving capacity allows the propositi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Legendre, F., Dequen, G., Krajecki, M.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Artificial Intelligence Ciphers Computer Science Cryptography and Security Encoding hash functions logical cryptanalysis Mathematical model Runtime satisfiability Silicon
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!