Mathematics Problem Archive

Combine the Meagher–Ritzenthaler criteria with Deligne modules to detect Jacobians in an ordinary absolutely simple abelian-threefold isogeny class....

For fixed $q$, is $N_q(g)=\max_C\#C(\mathbb{F}_q)$ increasing as a function of the genus $g$?...

Find a sharp upper bound for the shortest-vector length in an $n$-dimensional positive-definite Hermitian space of determinant $d$ over an imaginary q...

Speed up the computation of cryptographic pairings....

Find more MNT curves, including usable larger embedding degrees, more curve families, and smaller cofactors....

Construct pairing-friendly hyperelliptic curves suitable for cryptography....

Determine the exact computational-speed and security tradeoff for genus-four curves used in pairing cryptography....

Find an attack that breaks the pairing-based cryptographic system discussed in the slides, or establish its resistance to known attacks....

Break, or determine the true hardness of, the weaker security assumptions used in pairing-based cryptography....

Update Joux's 2002 work by developing a systematic taxonomy of pairing-related computational assumptions....

Is the Decision Linear problem strictly harder than the decisional Diffie–Hellman problem in the relevant pairing groups?...

Give the cited pairing-based signature constructions and their security proofs without relying on distortion maps....

Determine the computational hardness of the Pairing Inversion Problem....

Prove that general SVP and SIVP are hard in the worst case to approximate within small polynomial factors....

Prove an analogous small-polynomial-factor worst-case hardness result for SVP and SIVP on ideal lattices....

Is the shortest vector problem on ideal or cyclic lattices NP-hard, either exactly or under approximation?...

Is the minimum-distance problem for cyclic codes NP-hard?...

Reduce computational problems on arbitrary lattices to corresponding problems on cyclic or ideal lattices....

Does SVP reduce to CVP while remaining inside the class of cyclic or ideal lattices?...

Exhibit cyclic or ideal lattices on which LLL achieves its worst-case approximation factor....

Develop an algebraic analogue of the LLL lattice-reduction algorithm that exploits ideal-lattice structure....

Construct efficient pseudorandom generators from ideal-lattice problems....

Construct efficient pseudorandom functions from ideal-lattice problems....

Construct efficient digital-signature schemes from ideal-lattice problems....

Prove that quasi-cyclic lattice or code public-key constructions are secure based on worst-case hardness for quasi-cyclic structures....

Use algebraic tools to solve computational problems on ideal lattices efficiently....

Use lattice reduction together with average-case problems to solve computational problems in algebraic number theory....

Base cryptographic constructions directly on worst-case hardness assumptions from algebraic number theory....

Develop an efficient quantum algorithm for the Smallest Conjugate problem....

Develop an efficient quantum algorithm for the shortest vector problem on ideal lattices....

Construct an efficient ideal-lattice version of Regev's quantum-SVP-based cryptosystem....

Use number theory to prove non-malleability properties for real-world RSA key-generation algorithms....

Construct a malleable RSA generator producing publicly related moduli $n,n'$ such that factoring $n'$ makes $n$ easy to factor....

Construct practical groups in which discrete logarithms have an effective trapdoor....

Construct groups in which inversion is infeasible under reasonable cryptographic assumptions....

Construct improved practical trapdoor pairings....

Prove the simple construction from trapdoor groups with infeasible inversion to directed transitive signatures secure, or repair the construction....

Prove finiteness of the Shafarevich–Tate group of the elliptic-curve lift required by the Huang–Raskind method, in the general cases where it is not k...

Use a baby-step/giant-step infrastructure framework to speed infrastructure discrete logarithms or point counting by a polynomial factor....

Give efficient reductions in both directions between the degree-zero divisor-class-group discrete logarithm problem and the infrastructure discrete lo...

Is the odd-class-number condition in the stated lower bound for Heegner points necessary?...

Is the no-complex-multiplication condition in the stated lower bound for Heegner points necessary?...

Prove analogues of the stated Heegner-point results for points arising from nonmaximal orders....

Find an analogue of the Deuring Lifting Theorem for Darmon–Heegner points....

Can the lifting attack be improved by allowing the number-field degree $[K:\mathbb{Q}]$ to grow?...

Explicitly construct test elements or principal homogeneous spaces having prescribed ramification and a prescribed large prime order $\ell$....

Work efficiently with the testing characters and principal homogeneous spaces without constructing them explicitly....

Identify and solve tractable special cases of the signature problem described in the slides....

For nearby moduli $n_i=n_1+d_i$ and maps $f_i(r)=r^{e_i}\bmod n_i$, prove the conjecture that with sufficiently many components at least one $f_i$ is ...

For a prime $p$, conjecturally $p$ does not divide the class number of the maximal real subfield $\mathbb{Q}(\zeta_p+\overline{\zeta_p})$ of the $p$th...