Asymptotically faster quantum algorithms to solve multivariate quadratic equations
From MaRDI portal
Publication:1644796
DOI10.1007/978-3-319-79063-3_23zbMath1406.81016OpenAlexW2794901512MaRDI QIDQ1644796
Bo-Yin Yang, Daniel J. Bernstein
Publication date: 22 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-79063-3_23
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (6)
Quantum computing based state domain equations and feedback control ⋮ An estimator for the hardness of the MQ problem ⋮ 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 ⋮ Computer algebra tales on Goppa codes and McEliece cryptography
This page was built for publication: Asymptotically faster quantum algorithms to solve multivariate quadratic equations
