Asymptotically faster quantum algorithms to solve multivariate quadratic equations

DOI10.1007/978-3-319-79063-3_23MaRDI QIDQ1644796zbMATH OpenOpenAlexFDO

Authors Daniel J. Bernstein, Bo-Yin Yang

Publication date 22 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-79063-3_23

zbMATH Keywords

asymptoticsreversibilityparallelizationBennett-TompaFXLGrover

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Solving binary \(\mathcal {MQ}\) with Grover's algorithm
• Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
• Classical and Quantum Algorithms for Exponential Congruences
• Implementing Joux-Vitse's crossbred algorithm for solving \(\mathcal M\mathcal Q\) systems over \(\mathbb F_2\) on GPUs
• Quantum mechanical algorithm for solving quadratic residue equation

Cited in

(10)

• Quantum mechanical algorithm for solving quadratic residue equation
• Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
• On the complexity of solving generic overdetermined bilinear systems
• Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
• A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
• Fast quantum subroutines for the simplex method
• Computer algebra tales on Goppa codes and McEliece cryptography
• An estimator for the hardness of the MQ problem
• Using small-scale quantum devices to solve algebraic equations
• Quantum computing based state domain equations and feedback control

This page was built for publication: Asymptotically faster quantum algorithms to solve multivariate quadratic equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644796)