Evolution of dark web threat analysis and detection: A systematic approach

S Nazah, S Huda, J Abawajy, MM Hassan - Ieee Access, 2020 - ieeexplore.ieee.org
Dark Web is one of the most challenging and untraceable mediums adopted by the cyber
criminals, terrorists, and state-sponsored spies to fulfil their illicit motives. Cyber-crimes …

[КНИГА][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 …

Applications of SAT solvers to cryptanalysis of hash functions

I Mironov, L Zhang - Theory and Applications of Satisfiability Testing-SAT …, 2006 - Springer
Several standard cryptographic hash functions were broken in 2005. Some essential
building blocks of these attacks lend themselves well to automation by encoding them as …

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 …

A SAT-based preimage analysis of reduced Keccak hash functions

P Morawiecki, M Srebrny - Information Processing Letters, 2013 - Elsevier
In this paper, we present a preimage attack on reduced versions of Keccak hash functions.
We use our recently developed toolkit CryptLogVer for generating the conjunctive normal …

Encoding cryptographic functions to SAT using TRANSALG system

I Otpuschennikov, A Semenov, I Gribanova… - ECAI 2016, 2016 - ebooks.iospress.nl
In this paper we propose the technology for constructing propositional encodings of discrete
functions. It is aimed at solving inversion problems of considered functions using state-of-the …

[PDF][PDF] Inverting 43-step MD4 via Cube-and-Conquer.

O Zaikin - IJCAI, 2022 - researchgate.net
MD4 is a prominent cryptographic hash function proposed in 1990. The full version consists
of 48 steps and produces a hash of size 128 bits given a message of an arbitrary finite size …

Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems

A Semenov, I Otpuschennikov… - Logical Methods in …, 2020 - lmcs.episciences.org
In the present paper, we propose a technology for translating algorithmic descriptions of
discrete functions to SAT. The proposed technology is aimed at applications in algebraic …

[КНИГА][B] Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis

GV Bard - 2007 - search.proquest.com
Untitled Page 1 Page 2 ABSTRACT Title of dissertation: ALGORITHMS FOR SOLVING
LINEAR AND POLYNOMIAL SYSTEMS OF EQUATIONS OVER FINITE FIELDS WITH …

Adaptive restart and CEGAR-based solver for inverting cryptographic hash functions

S Nejati, JH Liang, C Gebotys, K Czarnecki… - … . Theories, Tools, and …, 2017 - Springer
SAT solvers are increasingly being used for cryptanalysis of hash functions and symmetric
encryption schemes. Inspired by this trend, we present MapleCrypt which is a SAT solver …