Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Solving binary \(\mathcal {MQ}\) with Grover's algorithm

From MaRDI portal
Publication:1989633
Jump to:navigation, search

DOI10.1007/978-3-319-49445-6_17zbMath1398.94158OpenAlexW2554483450MaRDI QIDQ1989633

Bas Westerbaan, Peter Schwabe

Publication date: 26 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-49445-6_17


zbMATH Keywords

Grover's algorithmmultivariate quadraticsquantum resource estimates


Mathematics Subject Classification ID

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


Related Items (5)

Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems ⋮ Improvements to quantum search techniques for block-ciphers, with applications to AES ⋮ An estimator for the hardness of the MQ problem ⋮ 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




This page was built for publication: Solving binary \(\mathcal {MQ}\) with Grover's algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1989633&oldid=14452659"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 17:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki