Mathematics Problem Archive

Showing 1351-1400 of 2196 problems (Page 28 of 44)

AMR-087-0049
Open

Detecting Jacobians via criteria and Deligne modules

v1.3 research notes

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

L3
Graph Theory
AMR-087-0050
Open

Monotonicity of maximal curve point counts in genus

v1.3 research notes

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

L3
Graph Theory
AMR-087-0051
Open

Shortest vectors in Hermitian lattices

v1.3 research notes

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...

L3
Graph Theory
AMR-087-0055
Open

Genus-four pairing speed-security tradeoff

v1.3 research notes

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

L3
Graph Theory
AMR-087-0056
Open

Breaking the pairing system

v1.3 research notes

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

L3
Graph Theory
AMR-087-0057
Open

Breaking weaker pairing assumptions

v1.3 research notes

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

L3
Graph Theory
AMR-087-0058
Open

Taxonomy of pairing-related assumptions

v1.3 research notes

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

L3
Graph Theory
AMR-087-0059
Open

Decision Linear versus DDH

v1.3 research notes

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

L3
Graph Theory
AMR-087-0062
Open

Polynomial-factor hardness of general lattice problems

v1.3 research notes

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

L3
Graph Theory
AMR-087-0065
Open

NP-hardness of minimum distance for cyclic codes

v1.3 research notes

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

L3
Graph Theory
AMR-087-0073
Open

Worst-case security of quasi-cyclic cryptosystems

v1.3 research notes

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

L3
Graph Theory
AMR-087-0075
Open

Lattice reduction for algebraic-number-theory problems

v1.3 research notes

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

L3
Graph Theory
AMR-087-0077
Open

Quantum algorithm for Smallest Conjugate

v1.3 research notes

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

L3
Graph Theory
AMR-087-0080
Open

Non-malleability of real RSA key generators

v1.3 research notes

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

L3
Graph Theory
AMR-087-0081
Open

Malleable RSA modulus generation

v1.3 research notes

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

L3
Graph Theory
AMR-087-0082
Open

Practical trapdoor discrete-logarithm groups

v1.3 research notes

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

L3
Graph Theory
AMR-087-0083
Open

Groups with infeasible inversion

v1.3 research notes

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

L3
Graph Theory
AMR-087-0084
Open

Better trapdoor pairings

v1.3 research notes

Construct improved practical trapdoor pairings....

L3
Graph Theory
AMR-087-0085
Open

Security of the TGII directed-signature construction

v1.3 research notes

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

L3
Graph Theory
AMR-087-0086
Open

Finiteness of a Shafarevich–Tate group needed by the lifting method

v1.3 research notes

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...

L3
Graph Theory
AMR-087-0089
Open

Necessity of the odd-class-number condition for Heegner bounds

v1.3 research notes

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

L3
Graph Theory
AMR-087-0090
Open

Necessity of the no-CM condition for Heegner bounds

v1.3 research notes

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

L3
Graph Theory
AMR-087-0091
Open

Heegner points from nonmaximal orders

v1.3 research notes

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

L3
Graph Theory
AMR-087-0092
Open

Deuring lifting for Darmon–Heegner points

v1.3 research notes

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

L3
Graph Theory
AMR-087-0093
Open

Growing-degree improvements to the lifting attack

v1.3 research notes

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

L3
Graph Theory
AMR-087-0094
Open

Explicit test homogeneous spaces of prescribed ramification

v1.3 research notes

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

L3
Graph Theory
AMR-087-0095
Open

Implicit computation with testing characters and homogeneous spaces

v1.3 research notes

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

L3
Graph Theory
AMR-087-0096
Open

Tractable special cases of the signature problem

v1.3 research notes

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

L3
Graph Theory
AMR-087-0097
Open

Trapdoor-free security from multiple nearby RSA moduli

v1.3 research notes

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 ...

L3
Graph Theory
AMR-088-0006
Open

Vandiver's conjecture

v1.3 research notes

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...

L4
Graph Theory
AMR-088-0007
Open

Nonvanishing of the p-adic zeta function at even integers

v1.3 research notes

Let $\zeta_p:\mathbb{Z}_p\to\mathbb{Q}_p$ be the $p$-adic zeta function. Is $\zeta_p(k)\ne0$ for every even integer $k$?...

L4
Graph Theory
AMR-088-0008
Open

Congruent number decision problem

v1.3 research notes

Given an integer $n$, determine whether there are rational numbers $x,y,z$ satisfying $x^2+y^2=z^2$ and $xy=2n$; equivalently, determine whether $n$ i...

L4
Graph Theory
AMR-088-0009
Open

Congruent numbers in residue classes 5, 6, and 7 modulo 8

v1.3 research notes

Is every integer $n\equiv5,6,$ or $7\pmod 8$ a congruent number?...

L4
Graph Theory
AMR-088-0010
Open

L-value criterion for congruent numbers

v1.3 research notes

For $E_n:y^2=x^3-n^2x$, is $n$ a congruent number if and only if $L(E_n,1)=0$?...

L4
Graph Theory
AMR-088-0012
Open

Infinitude of rational points on an elliptic curve

v1.3 research notes

Given an elliptic curve $E:y^2=x^3+Ax+B$ over $\mathbb{Q}$, determine whether $E$ has infinitely many rational points....

L3
Graph Theory
AMR-088-0013
Open

Bounded prime-sum criterion for rational points

v1.3 research notes

For an elliptic curve $E/\mathbb{Q}$, let $N_p$ be its number of solutions modulo $p$ plus one and put $f(X)=\sum_{p\le X}\log(N_p/p)$. Is $f(X)$ boun...

L3
Graph Theory
AMR-088-0014
Open

Prime-sum growth and elliptic-curve rank

v1.3 research notes

For an elliptic curve $E/\mathbb{Q}$ of rank $r$, does $f(X)=\sum_{p\le X}\log(N_p/p)$ grow asymptotically like $r\log\log X$?...

L3
Graph Theory
AMR-089-0002
Open

Higher-dimensional cropping formula

v1.3 research notes

Find a higher-dimensional analogue of the paper's cropping and summation argument; in dimension three the expected sum ranges over quadruples $v_1,v_2...

L3
Graph Theory
AMR-089-0003
Open

Complex continuation of the associated zeta function

v1.3 research notes

For $Z(s)=\sum f(a,b,c,d)^s$, which is known to converge for real $s>1/2$, extend $Z$ to complex values of $s$....

L3
Graph Theory
AMR-089-0005
Open

Modular extension and analogous lattice series

v1.3 research notes

Can the function $f$ on $SL(2,\mathbb{Z})$ be extended naturally to $\mathbb{C}/SL(2,\mathbb{Z})$? Can analogous series be constructed for other latti...

L3
Graph Theory
AMR-090-0001
Open

Odd-prime-power periodicity conjecture

v1.3 research notes

For every odd prime $p$ and $k\ge1$, is $s(p^k)=k$? For $k\ge2$, is $d(p^k)=p^{k-1}d(p)$?...

L3
Graph Theory
AMR-090-0002
Open

Power-of-two periodicity conjecture

v1.3 research notes

For every $k\ge1$, is $s(2^k)=u_k$? Is $d(2^k)=2^k$ for $k\ne2$, with $d(4)=2$?...

L3
Graph Theory
AMR-090-0003
Open

Arnold sequence as an f-transform

v1.3 research notes

Is Arnold's sequence $(u_k)_{k\ge1}$ the $f$-transform of the quadruple $(2,4,4,4)$?...

L3
Graph Theory
AMR-092-0001
Open

Existence of a four-dimensional Euler brick

v1.3 research notes

Do there exist positive integers $a,b,c,d$ such that all six pairwise face diagonals $\sqrt{a^2+b^2}$, $\sqrt{a^2+c^2}$, $\sqrt{a^2+d^2}$, $\sqrt{b^2+...

L3
Number Theory
AMR-092-0002
Open

Computational Diffie–Hellman problem

v1.3 research notes

Given a prime modulus $p$, a group generator $g$, and the public values $g^a$ and $g^b$ modulo $p$, can the shared value $g^{ab}\bmod p$ be computed e...

L3
Computer Science
AMR-092-0003
Open

A seventeenth-century proof of Fermat's Last Theorem

v1.3 research notes

Can Fermat's Last Theorem be proved using only mathematical techniques that were available in the seventeenth century?...

L3
Number Theory
AMR-092-0004
Open

Rational distances from the vertices of a square

v1.3 research notes

Given a unit square, does there exist a point in its plane, inside or outside the square, whose distances from all four vertices are rational? Equival...

L3
Geometry
AMR-092-0005
Open

Factor RSA-1024

v1.3 research notes

Find the two prime factors of the RSA-1024 challenge integer $1350664108659952233496032162788059699388814756056670275244851438515265106048595338339402...

L4
Number Theory
AMR-092-0006
Open

Semi-magic square of distinct positive cubes

v1.3 research notes

Does there exist a $3\times3$ semi-magic square whose nine entries are distinct positive integer cubes and whose three row sums and three column sums ...

L3
Number Theory
AMR-093-0002
Open

Carmichael's totient function conjecture

v1.3 research notes

Carmichael's totient function conjecture: do all values of Euler's totient function have multiplicity greater than $1$?...

L3
Number Theory