arXiv (All)
open access
A Note on Binary Quadratic Systems and their relation to complexity theory
algebraic-geometrycommutative-algebracomputational-complexitycryptography-and-securityinformation-theory
Deciding whether a system of multivariate quadratic equations over $\mathbb F_2$ has a solution is a classical NP-complete problem, and remains so for square systems, with as many equations as variables. The hardness of this problem is one of the cornerstones of nowadays post-quantum cryptography. L
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Report on Post-Quantum Cryptography#199374
- A Survey on Quantum-Safe Cryptographic Mechanisms: Building Blocks and Applications#999974
- Further Results on Sum-Freedom of Binary and $q$-ary Functions#1106188
- Are Cryptosystems Based on Ideal Lattices Quantum-Safe?#957534
- The Decision Problem for Entanglement#755828
Record · ID 984667
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive