New answers tagged computational-number-theory
1
vote
Accepted
The equation $ax^2 +by^2 =1 \mod P$ in cyclotomic field
This problem should really be posed over a general finite field (reductions of elements in $\mathcal O_L$ modulo $P$ can be computed in polynomial time).
Over any finite field $F$, the equation $ax^2+...
0
votes
Isogenous elliptic curves and canonical modular polynomials
It turns out that restricting to $\ell \in \{2,3,5,7,13\}$ (where the modular curve $X_0(\ell)$ has genus $0$) and assuming $p \neq \ell$ is sufficient, while experiments suggest that the approach ...
Top 50 recent answers are included
Related Tags
computational-number-theory × 476nt.number-theory × 341
prime-numbers × 74
analytic-number-theory × 63
algebraic-number-theory × 63
algorithms × 62
computational-complexity × 62
reference-request × 29
co.combinatorics × 28
modular-forms × 24
diophantine-equations × 23
elliptic-curves × 22
ag.algebraic-geometry × 21
polynomials × 21
computer-algebra × 17
factorization × 17
na.numerical-analysis × 11
cryptography × 11
computability-theory × 10
lattices × 10
linear-algebra × 9
ac.commutative-algebra × 9
arithmetic-geometry × 9
finite-fields × 9
gr.group-theory × 8