【摘 要】
：
I will first review basic algorithms:explicit Riemann-Roch and computing with the Picard group.I will then discuss the mathematics behind the problem of determi
【机 构】
：
UniversitédeBordeaux
【出 处】
：
Workshop on Computational Problems in Number Theory(数论中的计算问题
论文部分内容阅读
I will first review basic algorithms:explicit Riemann-Roch and computing with the Picard group.I will then discuss the mathematics behind the problem of deterministically encoding into curves of low genus.
其他文献
Serres Uniformity Conjecture is a statement concerning the Galois action on torsion points of elliptic curves defined over number fields.
The aim of the talk is to introduce some arithmetic properties of plane curves over finite fields,in particular to look at the distribution of their number of p
The elliptic curve discrete logarithm problem (ECDLP) is a computational problem that has many applications in cryptography.
We show how to efficiently compute functions on Jacobian varieties and their quotients.We deduce a quasi-optimal algorithm to compute (l,l) isogenies between Ja
This is a work in progress with Chantal David and Sandro Bettin.Is it possible to find families of elliptic curve such that the parity of the rank over Q(t) doe
The goal of this course is to make the audience familiar with various properties and results related to curves over finite fields.
Let E be an elliptic curve defined over Q with conductor N.From the modularity of E,it is known that there exists a rational map φ:X0(N)→E so-called the modul
We describe three new powerful multiprecision tools available in the Pari/GP package.First,new integration,summation,and extrapolation methods.
We will give an overview on euclidean and hermitian lattices in number theory,and in particular on reduction theories with a focus on Vonoro(i) reduction.
We consider a nonlocal delayed reaction-diffusion equation in a semi-infinite in-terval that describes mature population of a single species with two age st