An estimator for the hardness of the MQ problem

E Bellini, RH Makarim, C Sanna, J Verbel - International Conference on …, 2022 - Springer
Abstract The Multivariate Quadratic (MQ) problem consists in finding the solutions of a given
system of m quadratic equations in n unknowns over a finite field, and it is an NP-complete …

Solving Binary with Grover's Algorithm

P Schwabe, B Westerbaan - … Conference on Security, Privacy, and Applied …, 2016 - Springer
The problem of solving a system of quadratic equations in multiple variables—known as
multivariate-quadratic or MQ problem—is the underlying hard problem of various …

The Nested Subset Differential Attack: A Practical Direct Attack Against LUOV Which Forges a Signature Within 210 Minutes

J Ding, J Deaton, Vishakha, BY Yang - … on the Theory and Applications of …, 2021 - Springer
Abstract In 2017, Ward Beullens et al. submitted Lifted Unbalanced Oil and Vinegar, which is
a modification to the Unbalanced Oil and Vinegar Scheme by Patarin. Previously, Ding et al …

Boolean polynomial evaluation for the masses

C Bouillaguet - Cryptology ePrint Archive, 2022 - eprint.iacr.org
This article gives improved algorithms to evaluate a multivariate Boolean polynomial over all
the possible values of its input variables. Such a procedure is often used in cryptographic …

[PDF][PDF] Practical post-quantum cryptography

R Niederhagen, M Waidner - Fraunhofer SIT, 2017 - fraunhofer.sg
Quantum computers are hanging over the security of our information like a sword of
Damocles: We do not know when or even if quantum computers will become a reality—but …

Implementing Joux-Vitse's Crossbred Algorithm for Solving Systems over on GPUs

R Niederhagen, KC Ning, BY Yang - International Conference on Post …, 2018 - Springer
The hardness of solving multivariate quadratic (MQ) systems is the underlying problem for
multivariate-based schemes in the field of post-quantum cryptography. The concrete …

Quantum and Post-Quantum Cybersecurity Challenges and Finance Organizations Readiness

R Arshad, Q Riaz - Handbook of Research on Cybersecurity Issues …, 2023 - igi-global.com
Cryptography is used to protect sensitive information, but it is also required in many
applications to ensure secure functionality and availability. The 100-year-old principles of …

Compact circuits for efficient möbius transform

S Banik, F Regazzoni - IACR Transactions on Cryptographic …, 2024 - er.ceres.rub.de
The Möbius transform is a linear circuit used to compute the evaluations of a Boolean
function over all points on its input domain. The operation is very useful in finding the …

Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields

H Furue, T Takagi - International Conference on Post-Quantum …, 2023 - Springer
The enumeration of all outputs of a given multivariate polynomial is a fundamental
mathematical problem and is incorporated in some algebraic attacks on multivariate public …

A SAT-based approach for index calculus on binary elliptic curves

M Trimoska, S Ionica, G Dequen - International Conference on Cryptology …, 2020 - Springer
Logical cryptanalysis, first introduced by Massacci in 2000, is a viable alternative to common
algebraic cryptanalysis techniques over boolean fields. With xor operations being at the core …