Code obfuscation against symbolic execution attacks

S Banescu, C Collberg, V Ganesh… - Proceedings of the …, 2016 - dl.acm.org
Code obfuscation is widely used by software developers to protect intellectual property, and
malware writers to hamper program analysis. However, there seems to be little work on …

[图书][B] Algebraic cryptanalysis

G Bard - 2009 - books.google.com
Algebraic Cryptanalysis bridges the gap between a course in cryptography, and being able
to read the cryptanalytic literature. This book is divided into three parts: Part One covers the …

Machine learning attacks against the Asirra CAPTCHA

P Golle - Proceedings of the 15th ACM conference on Computer …, 2008 - dl.acm.org
The Asirra CAPTCHA [EDHS2007], proposed at ACM CCS 2007, relies on the problem of
distinguishing images of cats and dogs (a task that humans are very good at). The security of …

[PDF][PDF] Sha-3 proposal blake

JP Aumasson, L Henzen, W Meier… - Submission to …, 2008 - perso.uclouvain.be
In 1993, NIST published the first Secure Hash Standard SHA-0, which two years later was
superseded by SHA-1 to improve the original design. SHA-1 was still deemed secure by the …

Algebraic cryptanalysis of the data encryption standard

NT Courtois, GV Bard - Cryptography and Coding: 11th IMA International …, 2007 - Springer
In spite of growing importance of the Advanced Encryption Standard (AES), the Data
Encryption Standard (DES) is by no means obsolete. DES has never been broken from the …

Hardsatgen: Understanding the difficulty of hard sat formula generation and a strong structure-hardness-aware baseline

Y Li, X Chen, W Guo, X Li, W Luo, J Huang… - Proceedings of the 29th …, 2023 - dl.acm.org
Industrial SAT formula generation is a critical yet challenging task. Existing SAT generation
approaches can hardly simultaneously capture the global structural properties and maintain …

Exponential recency weighted average branching heuristic for SAT solvers

J Liang, V Ganesh, P Poupart… - Proceedings of the AAAI …, 2016 - ojs.aaai.org
Modern conflict-driven clause-learning SAT solvers routinely solve large real-world
instances with millions of clauses and variables in them. Their success crucially depends on …

Algebraic and slide attacks on KeeLoq

NT Courtois, GV Bard, D Wagner - … 10-13, 2008, Revised Selected Papers …, 2008 - Springer
KeeLoq is a block cipher used in wireless devices that unlock the doors and alarms in cars
manufactured by Chrysler, Daewoo, Fiat, GM, Honda, Jaguar, Toyota, Volvo, Volkswagen …

Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF (2) via SAT-solvers

GV Bard, NT Courtois, C Jefferson - Cryptology ePrint Archive, 2007 - eprint.iacr.org
The computational hardness of solving large systems of sparse and low-degree multivariate
equations is a necessary condition for the security of most modern symmetric cryptographic …

[PDF][PDF] SymTCP: Eluding stateful deep packet inspection with automated discrepancy discovery

Z Wang, S Zhu - Network and Distributed System Security Symposium …, 2020 - par.nsf.gov
A key characteristic of commonly deployed deep packet inspection (DPI) systems is that they
implement a simplified state machine of the network stack that often differs from that of …