Mathematics catalogue
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
16,859 records · Search and filter
- Math-13101 O33b — Randomized NP-hardness of binary quadratic Diophantine solvability
- Math-13102 Conjecture 2.12
- Math-13103 Conjecture 3.13 — Blum, Cucker, Shub and Smale
- Math-13104 Conjecture 3.14
- Math-13105 Conjecture 4.13 — Laurent-Roy
- Math-13106 Cryptographically useful bilinear structures
- Math-13107 Explicit class-group realization of finite-field discrete logarithms
- Math-13108 Security consequences of Weil descent for the class-group realization
- Math-13109 Computational realization of a second cohomology group
- Math-13110 Explicit cocycles and invariants for split local algebras
- Math-13111 Factoring a three-prime integer from fewer known bits
- Math-13112 Learning from wrong guesses in partial-key factoring
- Math-13113 Roots of x-squared minus one modulo a composite
- Math-13114 Optimal polynomial collections for lattice attacks
- Math-13115 Dimension reduction in small-root lattices
- Math-13116 Zero-constant-term Newton-polytope case
- Math-13117 Cryptographic primitives from hard small roots
- Math-13118 Quality of rotation-augmented cyclic-lattice reduction
- Math-13119 Faster cyclic-lattice reduction
- Math-13120 Typical exponent of an elliptic-curve group
- Math-13121 Typical arithmetic structure of elliptic-curve orders
- Math-13122 Prime-order curves over every finite field
- Math-13123 Prime extension-degree quotients of elliptic-curve orders
- Math-13124 Elliptic curves with smooth group order
- Math-13125 Elliptic-curve orders with a large prime divisor
- Math-13126 Distribution of elliptic-curve pseudorandom sequences
- Math-13127 Genus-four pairing speed-security tradeoff
- Math-13128 Breaking the pairing system
- Math-13129 Breaking weaker pairing assumptions
- Math-13130 Decision Linear versus DDH
- Math-13131 Pairing signatures without distortion maps
- Math-13132 Hardness of the Pairing Inversion Problem
- Math-13133 Algebraic algorithms for ideal-lattice problems
- Math-13134 Lattice reduction for algebraic-number-theory problems
- Math-13135 Non-malleability of real RSA key generators
- Math-13136 Malleable RSA modulus generation
- Math-13137 Better trapdoor pairings
- Math-13138 Security of the TGII directed-signature construction
- Math-13139 Faster infrastructure discrete logarithms and point counting
- Math-13140 Necessity of the odd-class-number condition for Heegner bounds
- Math-13141 Heegner points from nonmaximal orders
- Math-13142 Deuring lifting for Darmon–Heegner points
- Math-13143 Growing-degree improvements to the lifting attack
- Math-13144 Explicit test homogeneous spaces of prescribed ramification
- Math-13145 Implicit computation with testing characters and homogeneous spaces
- Math-13146 Tractable special cases of the signature problem
- Math-13147 Trapdoor-free security from multiple nearby RSA moduli
- Math-13148 Nonvanishing of the p-adic zeta function at even integers
- Math-13149 Coordinates on convex domains
- Math-13150 Higher-dimensional cropping formula