相关论文: Computation of 2-groups of narrow logarithmic divi…

We present an algorithm for computing the 2-group of the positive divisor classes of a number field F in case F has exceptional dyadic places. As an application, we compute the 2-rank of the wild kernel WK2(F) in K2(F) for such number…

We present an algorithm for the computation of logarithmic l-class groups of number fields. Our principal motivation is the effective determination of the l-rank of the wild kernel in the K-theory of number fields.

By using the logarithmic approach of the classical kernels for the K2 of number fields, we compute the 2-rank of the wild kernel WK2(F) and the 2-rank of the subgroup of infinite heigh elements in K2(F) in terms of positive class groups for…

We study the l-part of the the wild \'etale kernels WK2i(F) of an arbitary number field F for a given prime l in connection with the logarithmic l-class groups. From the logarithmic arithmetic we deduce rank formulas, periodicity and…

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

In this paper, we determine the 2-rank of the class group of certain classes of real cyclic quartic number fields. Precisely, we consider the case in which the quadratic subfield is Q(\sqrt{l}) with l=2 or a prime congruent to 1 mod 8.

We determine some properties of the narrow 2-class field tower of those real quadratic number fields whose discriminants are not a sum of two squares and for which their 2-class groups are elementary of order $4$. Here in Part I, we…

Let $n\geq 3$ be an integer and $d$ an odd square-free integer. We shall compute the rank of the $2$-class group of $L_{n,d}:=\mathbb{Q}(\zeta_{2^n},\sqrt{d})$, when all the prime divisors of $d$ are congruent to $\pm 3\pmod 8$ or…

A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…

Let $k$ be a fixed finite geometric extension of the rational function field $\mathbb{F}_q(t)$. Let $F/k$ be a finite abelian extension such that there is an $\Fq$-rational place $\infty$ in $k$ which splits in $F/k$ and let $\mathcal{O}_F$…

We use computer algebra to determine the ranks of arrays of size 2 x 2 x 2 and 2 x 2 x 2 x 2 with entries in the set {0, 1} regarded as a field with two elements, as a Boolean algebra, and as non-negative integers. In the field case we also…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

This paper introduces two new algorithms for Lie algebras over finite fields and applies them to the investigate the known simple Lie algebras of dimension at most $20$ over the field $\mathbb{F}_2$ with two elements. The first algorithm is…

Let $K=\mathbb{Q}(\sqrt[4]{pd^{2}})$ be a real pure quartic number field and $k=\mathbb{Q}(\sqrt{p})$ its real quadratic subfield, where $p\equiv 5\pmod 8$ is a prime integer and $d$ an odd square-free integer coprime to $p$. In this work,…

We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)

We present an index calculus algorithm with double large prime variation which lends itself well to a rigorous analysis. Using this algorithm we prove that for fixed genus $g \geq 2$, the discrete logarithm problem in degree 0 class groups…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

We determine the Galois group of the 2-class field tower for two particular families of imaginary quadratic number fields $k$ with $2$-class field tower of length $2$.