The generalized Rédei-matrix for function fields

On ring class eigenspaces of Mordell–Weil groups of elliptic curves over global function fields

The elliptic curve cryptography is almost used in the literature to develop the public key cryptosystems. A new general-purpose symmetric key cryptosystem using elliptic prime curves is proposed in this paper. For a given prime number P, there are many elliptic prime curves on which each point in the quadrant (0,0) to (P-1,P-1) lays. The set of minimum number of eligible elliptic prime curves for a given prime number P constitutes a lookup table that is the secret key of the proposed cryptosystem. The sender can pick up one eligible elliptic curve for each 2n-bit plaintext block. The sender sends two integers cipher for each 2n-bit plaintext block with encryption rate = 0.8. Moreover, a small prime number can be used efficiently with high security and good robustness against brute force attack.

Reflection principles for class groups

Let K be a global field of char p and let Fq ⊂ K denote the algebraic closure of Fp in K. We fix an elliptic curve E/K with non-constant j-invariant and a torsion-free subgroup Σ ⊆ E(K) of rank r > 0. We write V for the open set of places v of K such that the special fiber Ev is an elliptic curve and, for v in V , we let Σv ⊂ Ev(kv) be the image of Σ under reduction modulo v, where kv is the residue field of K at v. We fix a finite set of (rational) prime numbers S which is large enough to include the exceptional primes which we will define explicitly in section 2.4 and section 3), and we let G(Σ, S) denote the subset of v ∈ V such that Σv contains the prime-to-S part of Ev(kv). For every n > 0, we write Vn for the subset of v ∈ V such that deg(v) = n and let Gn(Σ, S) = Vn ∩ G(Σ, S).

On Roth's theorem. The celebrated theorem of Roth, together with its generalizations given by Mahler and Ridout, gives a lower bound for the degree of approximation of one or more algebraic numbers with respect to a fixed set of valuations by elements of a fixed number field. An analogous result holds for function fields in characteristic zero. In this paper we do the following: (1) generalize Roth's theorem to the case of fields with a product formula in characteristic zero, removing any technical hypothesis from a previous result of Lang: (2) give a unified proof of Roth's theorem in the number field and function field cases; (3) provide a quantitative version of the general Roth's theorem, extending, even in the number field case, previous results of Bombieri and Van Der Poorten.

On elementary estimates of arithmetic sums for polynomial rings over finite fields

This chapter develops tools for a more penetrating study of algebraic number theory than was possible in Chapter V and concludes by formulating two of the main three theorems of Chapter V in the modern setting of “adeles” and “ideles” commonly used in the subject.Sections 1–5 introduce discrete valuations, absolute values, and completions for fields, always paying attention to implications for number fields and for certain kinds of function fields. Section 1 contains a prototype for all these notions in the construction of the fieldQp of p-adic numbers formed out of the rationals. Discrete valuations in Section 2 are a generalization of the order-of-vanishing function about a point in the theory of one complex variable. Absolute values in Section 3 are real-valued multiplicative functions that give a metric on a field, and the pair consisting of a field and an absolute value is called a valued field. Inequivalent absolute values have a certain independence property that is captured by the Weak Approximation Theorem. Completions in Section 4 are functions mapping valued fields into their metric-space completions. Section 5 concerns Hensel’s Lemma, which in its simplest form allows one to lift roots of polynomials over finite prime fields Fp to roots of corresponding polynomials over p-adic fields Qp.Section 6 contains the main theorem for investigating the fundamental question of how prime ideals split in extensions. Let K be a finite separable extension of a field F, let R be a Dedekind domain with field of fractions F, and let T be the integral closure of R in K. The question concerns the factorization of an ideal pT in T when p is a nonzero prime ideal in R. If Fp denotes the completion of F with respect to p, the theorem explains how the tensor product K ⊗F Fp splits uniquely as a direct sum of completions of valued fields. The theorem in effect reduces the question of the splitting of pT in T to the splitting of Fp in a complete field in which only one of the prime factors of pT plays a role.Section 7 is a brief aside mentioning additional conclusions one can draw when the extension K/F is a Galois extension.Section 8 applies the main theorem of Section 6 to an analysis of the different of K/F and ultimately to the absolute discriminant of a number field. With the new sharp tools developed in the present chapter, including a Strong Approximation Theorem that is proved in Section 8, a complete proof is given for the Dedekind Discriminant Theorem; only a partial proof had been accessible in Chapter V.Sections 9–10 specialize to the case of number fields and to function fields that are finite separable extensions of Fq (X), where Fq is a finite field. The adele ring and the idele group are introduced for each of these kinds of fields, and it is shown how the original field embeds discretely in the adeles and how the multiplicative group embeds discretely in the ideles. The main theorems are compactness theorems about the quotient of the adeles by the embedded field and about the quotient of the normalized ideles by the embedded multiplicative group. Proofs are given only for number fields. In the first case the compactness encodes the Strong Approximation Theorem of Section 8 and the Artin product formula of Section 9. In the second case the compactness encodes both the finiteness of the class number and the Dirichlet Unit Theorem.KeywordsPrime IdealValuation RingBasic AlgebraDedekind DomainFractional IdealThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Let K be a fixed number field, assumed to be Galois over ℚ. Let r and f be fixed integers with f positive. Given an elliptic curve E, defined over K, we consider the problem of counting the number of degree f prime ideals of K with trace of Frobenius equal to r. Except in the case f = 2, we show that ‘on average,’ the number of such prime ideals with norm less than or equal to x satisfies an asymptotic identity that is in accordance with standard heuristics. This work is related to the classical Lang–Trotter conjecture and extends the work of several authors.

The structure of analytic τ-sheaves

l-Class groups of cyclic function fields of degree l

Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic assumptions.In this paper we introduce the notion of the last fall degree of a polynomial system, which is independent of choice of a monomial order. We then develop complexity bounds on solving polynomial systems based on this last fall degree.We prove that HFE systems have a small last fall degree, by showing that one can do division with remainder after Weil descent. This allows us to solve HFE systems unconditionally in polynomial time if the degree of the defining polynomial and the cardinality of the base field are fixed. For the ECDLP over a finite field of characteristic 2, we provide computational evidence that raises doubt on the validity of the first fall degree assumption, which was widely adopted in earlier works and which promises sub-exponential algorithms for ECDLP. In addition, we construct a Weil descent system from a set of summation polynomials in which the first fall degree assumption is unlikely to hold. These examples suggest that greater care needs to be exercised when applying this heuristic assumption to arrive at complexity estimates.These results taken together underscore the importance of rigorously bounding last fall degrees of Weil descent systems, which remains an interesting but challenging open problem.KeywordsHFEECDLPWeil descentSolving equationsFirst fall degreeLast fall degree

Using the reduction theory of Nrron we give necessary conditions for the existence of points of order q on elliptic curves E rational over global fields. An application is the determination of all elliptic cu rves /Q with integer j and torsion points, generalizing Olson [8]. Another application is a theorem about semistable reduction whose consequences generalize a theorem of Olson [9] ( K = Q) and give divisibility conditions for the discriminant and the coefficients of E related with the paper of Zimmer [13] as well as diophantine equations related with Fermat's equation that are discussed for K Q and K a function field. We are interested in elliptic curves over global fields K (i.e. : K is a finite number field or K is a function field of one variable over a finite field) and especially in the torsion group of E(K), where E(K) is the group of K-rational points of E. It is well known that E(K) is finitely generated, it is conjectured that if K is a number field then the order of the torsion group of E(K) is bounded by some number depending only on K (cf. Demjanenko [1]). In any case in order to handle with E(K) the first step is to determine the torsion group. In principle this is not so difficult; if one uses the results of Lutz [6] and Zimmer [13], one sees immediately that for every E there exist points of q-power-order only for a finite number of primes q, as the equations for points of order q are known (in principle) one has only t ~ test what orders really occur. But as the computational work grows very rapidly with q it is usefull to look for sharper necessary conditions, and this shall be done in this paper.

Chebyshevʼs bias in Galois extensions of global function fields

We study the minimal resultant divisor of self-maps of the projective line over a number field or a function field and its relation to the conductor. The guiding focus is the exploration of a dynamical analog to Theorem 1.1, which bounds the degree of the minimal discriminant of an elliptic surface in terms of the conductor. The main theorems of this paper (5.5 and 5.6) establish that, for a degree 2 map, semi-stability in the Geometric Invariant Theory sense on the space of self maps, implies minimality of the resultant. We prove the singular reduction of a semi-stable presentation coincides with the simple bad reduction (Theorem 4.1). Given an elliptic curve over a function field with semi-stable bad reduction, we show the associated Lattes map has unstable bad reduction (Proposition 4.6). Degree 2 maps in normal form with semi-stable bad reduction are used to construct a counterexample (Example 3.1) to a simple dynamical analog to Theorem 1.1.

Ideal class groups of division fields of elliptic curves and everywhere unramified rational points