Opening the black box inside Grover's algorithm

EM Stoudenmire, X Waintal - Physical Review X, 2024 - APS
Grover's algorithm is one of the primary algorithms offered as evidence that quantum
computers can provide an advantage over classical computers. It involves an …

Extending SAT solvers to cryptographic problems

M Soos, K Nohl, C Castelluccia - International Conference on Theory and …, 2009 - Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on
unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain …

[BOEK][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 …

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 …

Efficient optimization with higher-order Ising machines

C Bybee, D Kleyko, DE Nikonov… - Nature …, 2023 - nature.com
A prominent approach to solving combinatorial optimization problems on parallel hardware
is Ising machines, ie, hardware implementations of networks of interacting binary spin …

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 …

An overview of cryptanalysis research for the advanced encryption standard

A Kaminsky, M Kurdziel… - 2010-MILCOM 2010 …, 2010 - ieeexplore.ieee.org
Since its release in November 2001, the Advanced Encryption Standard (NIST FIPS-197)
has been the subject of extensive cryptanalysis research. The importance of this research …

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 …

Grover's algorithm offers no quantum advantage

EM Stoudenmire, X Waintal - arxiv preprint arxiv:2303.11317, 2023 - arxiv.org
Grover's algorithm is one of the primary algorithms offered as evidence that quantum
computers can provide an advantage over classical computers. It involves an" …

Manthan: A data-driven approach for boolean function synthesis

P Golia, S Roy, KS Meel - International Conference on Computer Aided …, 2020 - Springer
Boolean functional synthesis is a fundamental problem in computer science with wide-
ranging applications and has witnessed a surge of interest resulting in progressively …