Zero Cycles on Certain Singular Elliptic Surfaces Compositio Mathematica, Tome 52, No 2 (1984), P
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday, October 24, 1995 (Day 1)
QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday, October 24, 1995 (Day 1) 1. Let K be a ¯eld of characteristic 0. a. Find three nonconstant polynomials x(t); y(t); z(t) K[t] such that 2 x2 + y2 = z2 b. Now let n be any integer, n 3. Show that there do not exist three nonconstant polynomials x(t); y(t); z(t) K[t] suc¸h that 2 xn + yn = zn: 2. For any integers k and n with 1 k n, let · · Sn = (x ; : : : ; x ) : x2 + : : : + x2 = 1 n+1 f 1 n+1 1 n+1 g ½ be the n-sphere, and let D n+1 be the closed disc k ½ D = (x ; : : : ; x ) : x2 + : : : + x2 1; x = : : : = x = 0 n+1: k f 1 n+1 1 k · k+1 n+1 g ½ n Let X = S D be their union. Calculate the cohomology ring H¤(X ; ¡ ). k;n [ k k;n 2 3. Let f : be any 1 map such that ! C @2f @2f + 0: @x2 @y2 ´ Show that if f is not surjective then it is constant. 4. Let G be a ¯nite group, and let ; ¿ G be two elements selected at random from G (with the uniform distribution). In terms2 of the order of G and the number of conjugacy classes of G, what is the probability that and ¿ commute? What is the probability if G is the symmetric group S5 on 5 letters? 1 5. Let be the region given by ½ = z : z 1 < 1 and z i < 1 : f j ¡ j j ¡ j g Find a conformal map f : ¢ of onto the unit disc ¢ = z : z < 1 . -
Examples from Complex Geometry
Examples from Complex Geometry Sam Auyeung November 22, 2019 1 Complex Analysis Example 1.1. Two Heuristic \Proofs" of the Fundamental Theorem of Algebra: Let p(z) be a polynomial of degree n > 0; we can even assume it is a monomial. We also know that the number of zeros is at most n. We show that there are exactly n. 1. Proof 1: Recall that polynomials are entire functions and that Liouville's Theorem says that a bounded entire function is in fact constant. Suppose that p has no roots. Then 1=p is an entire function and it is bounded. Thus, it is constant which means p is a constant polynomial and has degree 0. This contradicts the fact that p has positive degree. Thus, p must have a root α1. We can then factor out (z − α1) from p(z) = (z − α1)q(z) where q(z) is an (n − 1)-degree polynomial. We may repeat the above process until we have a full factorization of p. 2. Proof 2: On the real line, an algorithm for finding a root of a continuous function is to look for when the function changes signs. How do we generalize this to C? Instead of having two directions, we have a whole S1 worth of directions. If we use colors to depict direction and brightness to depict magnitude, we can plot a graph of a continuous function f : C ! C. Near a zero, we'll see all colors represented. If we travel in a loop around any point, we can keep track of whether it passes through all the colors; around a zero, we'll pass through all the colors, possibly many times. -
Patching and Galois Theory David Harbater∗ Dept. of Mathematics
Patching and Galois theory David Harbater∗ Dept. of Mathematics, University of Pennsylvania Abstract: Galois theory over (x) is well-understood as a consequence of Riemann's Existence Theorem, which classifies the algebraic branched covers of the complex projective line. The proof of that theorem uses analytic and topological methods, including the ability to construct covers locally and to patch them together on the overlaps. To study the Galois extensions of k(x) for other fields k, one would like to have an analog of Riemann's Existence Theorem for curves over k. Such a result remains out of reach, but partial results in this direction can be proven using patching methods that are analogous to complex patching, and which apply in more general contexts. One such method is formal patching, in which formal completions of schemes play the role of small open sets. Another such method is rigid patching, in which non-archimedean discs are used. Both methods yield the realization of arbitrary finite groups as Galois groups over k(x) for various classes of fields k, as well as more precise results concerning embedding problems and fundamental groups. This manuscript describes such patching methods and their relationships to the classical approach over , and shows how these methods provide results about Galois groups and fundamental groups. ∗ Supported in part by NSF Grants DMS9970481 and DMS0200045. (Version 3.5, Aug. 30, 2002.) 2000 Mathematics Subject Classification. Primary 14H30, 12F12, 14D15; Secondary 13B05, 13J05, 12E30. Key words and phrases: fundamental group, Galois covers, patching, formal scheme, rigid analytic space, affine curves, deformations, embedding problems. -
An Arithmetic Riemann-Roch Theorem for Pointed Stable Curves
An arithmetic Riemann-Roch theorem for pointed stable curves Gerard Freixas i Montplet Abstract.- Let ( , Σ, F∞) be an arithmetic ring of Krull dimension at most 1, O = Spec and (π : ; σ1,...,σ ) a n-pointed stable curve of genus g. Write S O X → S n = σ ( ). The invertible sheaf ωX S(σ1 + ... + σ ) inherits a hermitian struc- U X \ ∪j j S / n ture hyp from the dual of the hyperbolic metric on the Riemann surface ∞. In this articlek·k we prove an arithmetic Riemann-Roch type theorem that computes theU arith- metic self-intersection of ωX /S(σ1 + ... + σn)hyp. The theorem is applied to modular curves X(Γ), Γ = Γ0(p) or Γ1(p), p 11 prime, with sections given by the cusps. We ′ a b c ≥ show Z (Y (Γ), 1) e π Γ2(1/2) L(0, Γ), with p 11 mod 12 when Γ = Γ0(p). Here Z(Y (Γ),s) is the Selberg∼ zeta functionM of the open modular≡ curve Y (Γ), a,b,c are rational numbers, Γ is a suitable Chow motive and means equality up to algebraic unit. M ∼ Resum´ e.-´ Soit ( , Σ, F∞) un anneau arithm´etique de dimension de Krull au plus 1, O = Spec et (π : ; σ1,...,σ ) une courbe stable n-point´ee de genre g. Posons S O X → S n = σ ( ). Le faisceau inversible ωX S(σ1+...+σ ) h´erite une structure hermitienne U X \∪j j S / n hyp du dual de la m´etrique hyperbolique sur la surface de Riemann ∞. Dans cet article nousk·k prouvons un th´eor`eme de Riemann-Roch arithm´etique qui calculeU l’auto-intersection arithm´etique de ωX /S(σ1 + ...+ σn)hyp. -
A Review on Elliptic Curve Cryptography for Embedded Systems
International Journal of Computer Science & Information Technology (IJCSIT), Vol 3, No 3, June 2011 A REVIEW ON ELLIPTIC CURVE CRYPTOGRAPHY FOR EMBEDDED SYSTEMS Rahat Afreen 1 and S.C. Mehrotra 2 1Tom Patrick Institute of Computer & I.T, Dr. Rafiq Zakaria Campus, Rauza Bagh, Aurangabad. (Maharashtra) INDIA [email protected] 2Department of C.S. & I.T., Dr. B.A.M. University, Aurangabad. (Maharashtra) INDIA [email protected] ABSTRACT Importance of Elliptic Curves in Cryptography was independently proposed by Neal Koblitz and Victor Miller in 1985.Since then, Elliptic curve cryptography or ECC has evolved as a vast field for public key cryptography (PKC) systems. In PKC system, we use separate keys to encode and decode the data. Since one of the keys is distributed publicly in PKC systems, the strength of security depends on large key size. The mathematical problems of prime factorization and discrete logarithm are previously used in PKC systems. ECC has proved to provide same level of security with relatively small key sizes. The research in the field of ECC is mostly focused on its implementation on application specific systems. Such systems have restricted resources like storage, processing speed and domain specific CPU architecture. KEYWORDS Elliptic curve cryptography Public Key Cryptography, embedded systems, Elliptic Curve Digital Signature Algorithm ( ECDSA), Elliptic Curve Diffie Hellman Key Exchange (ECDH) 1. INTRODUCTION The changing global scenario shows an elegant merging of computing and communication in such a way that computers with wired communication are being rapidly replaced to smaller handheld embedded computers using wireless communication in almost every field. This has increased data privacy and security requirements. -
Contents 5 Elliptic Curves in Cryptography
Cryptography (part 5): Elliptic Curves in Cryptography (by Evan Dummit, 2016, v. 1.00) Contents 5 Elliptic Curves in Cryptography 1 5.1 Elliptic Curves and the Addition Law . 1 5.1.1 Cubic Curves, Weierstrass Form, Singular and Nonsingular Curves . 1 5.1.2 The Addition Law . 3 5.1.3 Elliptic Curves Modulo p, Orders of Points . 7 5.2 Factorization with Elliptic Curves . 10 5.3 Elliptic Curve Cryptography . 14 5.3.1 Encoding Plaintexts on Elliptic Curves, Quadratic Residues . 14 5.3.2 Public-Key Encryption with Elliptic Curves . 17 5.3.3 Key Exchange and Digital Signatures with Elliptic Curves . 20 5 Elliptic Curves in Cryptography In this chapter, we will introduce elliptic curves and describe how they are used in cryptography. Elliptic curves have a long and interesting history and arise in a wide range of contexts in mathematics. The study of elliptic curves involves elements from most of the major disciplines of mathematics: algebra, geometry, analysis, number theory, topology, and even logic. Elliptic curves appear in the proofs of many deep results in mathematics: for example, they are a central ingredient in the proof of Fermat's Last Theorem, which states that there are no positive integer solutions to the equation xn + yn = zn for any integer n ≥ 3. Our goals are fairly modest in comparison, so we will begin by outlining the basic algebraic and geometric properties of elliptic curves and motivate the addition law. We will then study the behavior of elliptic curves modulo p: ultimately, there is a fairly strong analogy between the structure of the points on an elliptic curve modulo p and the integers modulo n. -
An Efficient Approach to Point-Counting on Elliptic Curves
mathematics Article An Efficient Approach to Point-Counting on Elliptic Curves from a Prominent Family over the Prime Field Fp Yuri Borissov * and Miroslav Markov Department of Mathematical Foundations of Informatics, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria; [email protected] * Correspondence: [email protected] Abstract: Here, we elaborate an approach for determining the number of points on elliptic curves 2 3 from the family Ep = fEa : y = x + a (mod p), a 6= 0g, where p is a prime number >3. The essence of this approach consists in combining the well-known Hasse bound with an explicit formula for the quantities of interest-reduced modulo p. It allows to advance an efficient technique to compute the 2 six cardinalities associated with the family Ep, for p ≡ 1 (mod 3), whose complexity is O˜ (log p), thus improving the best-known algorithmic solution with almost an order of magnitude. Keywords: elliptic curve over Fp; Hasse bound; high-order residue modulo prime 1. Introduction The elliptic curves over finite fields play an important role in modern cryptography. We refer to [1] for an introduction concerning their cryptographic significance (see, as well, Citation: Borissov, Y.; Markov, M. An the pioneering works of V. Miller and N. Koblitz from 1980’s [2,3]). Briefly speaking, the Efficient Approach to Point-Counting advantage of the so-called elliptic curve cryptography (ECC) over the non-ECC is that it on Elliptic Curves from a Prominent requires smaller keys to provide the same level of security. Family over the Prime Field Fp. -
NNALES SCIEN IFIQUES SUPÉRIEU E D L ÉCOLE ORMALE
ISSN 0012-9593 ASENAH quatrième série - tome 42 fascicule 2 mars-avril 2009 NNALES SCIENIFIQUES d L ÉCOLE ORMALE SUPÉRIEUE Gérard FREIXAS i MONTPLET An arithmetic Riemann-Roch theorem for pointed stable curves SOCIÉTÉ MATHÉMATIQUE DE FRANCE Ann. Scient. Éc. Norm. Sup. 4 e série, t. 42, 2009, p. 335 à 369 AN ARITHMETIC RIEMANN-ROCH THEOREM FOR POINTED STABLE CURVES ʙʏ Gʀʀ FREIXAS ɪ MONTPLET Aʙʀ. – Let ( , Σ,F ) be an arithmetic ring of Krull dimension at most 1, =Spec and O ∞ S O (π : ; σ1,...,σn) an n-pointed stable curve of genus g. Write = j σj ( ). The invertible X→S U X\∪ S sheaf ω / (σ1 + + σn) inherits a hermitian structure hyp from the dual of the hyperbolic met- X S ··· · ric on the Riemann surface . In this article we prove an arithmetic Riemann-Roch type theorem U∞ that computes the arithmetic self-intersection of ω / (σ1 + + σn)hyp. The theorem is applied to X S ··· modular curves X(Γ), Γ=Γ0(p) or Γ1(p), p 11 prime, with sections given by the cusps. We show a b c ≥ Z(Y (Γ), 1) e π Γ2(1/2) L(0, Γ), with p 11 mod 12 when Γ=Γ0(p). Here Z(Y (Γ),s) is ∼ M ≡ the Selberg zeta function of the open modular curve Y (Γ), a, b, c are rational numbers, Γ is a suitable M Chow motive and means equality up to algebraic unit. ∼ R. – Soient ( , Σ,F ) un anneau arithmétique de dimension de Krull au plus 1, O ∞ =Spec et (π : ; σ1,...,σn) une courbe stable n-pointée de genre g. -
Automorphy of Mod 2 Galois Representations Associated to Certain Genus 2 Curves Over Totally Real Fields
AUTOMORPHY OF MOD 2 GALOIS REPRESENTATIONS ASSOCIATED TO CERTAIN GENUS 2 CURVES OVER TOTALLY REAL FIELDS ALEXANDRU GHITZA AND TAKUYA YAMAUCHI Abstract. Let C be a genus two hyperelliptic curve over a totally real field F . We show that the mod 2 Galois representation ρC;2 : Gal(F =F ) −! GSp4(F2) attached to C is automorphic when the image of ρC;2 is isomorphic to S5 and it is also a transitive subgroup under a fixed isomorphism GSp4(F2) ' S6. To be more precise, there exists a Hilbert{Siegel Hecke eigen cusp form h on GSp4(AF ) of parallel weight two whose mod 2 Galois representation ρh;2 is isomorphic to ρC;2. 1. Introduction Let K be a number field in an algebraic closure Q of Q and p be a prime number. Fix an embedding Q ,! C and an isomorphism Qp ' C. Let ι = ιp : Q −! Qp be an embedding that is compatible with the maps Q ,! C and Qp ' C fixed above. In proving automorphy of a given geometric p-adic Galois representation ρ : GK := Gal(Q=K) −! GLn(Qp); a standard way is to observe automorphy of its residual representation ρ : GK −! GLn(Fp) after choosing a suitable integral lattice. However, proving automorphy of ρ is hard unless the image of ρ is small. If the image is solvable, one can use the Langlands base change argument to find an automorphic cuspidal representation as is done in many known cases. Beyond this, one can ask that p and the image of ρ be small enough that one can apply the known cases of automorphy of Artin representations (cf. -
25 Modular Forms and L-Series
18.783 Elliptic Curves Spring 2015 Lecture #25 05/12/2015 25 Modular forms and L-series As we will show in the next lecture, Fermat's Last Theorem is a direct consequence of the following theorem [11, 12]. Theorem 25.1 (Taylor-Wiles). Every semistable elliptic curve E=Q is modular. In fact, as a result of subsequent work [3], we now have the stronger result, proving what was previously known as the modularity conjecture (or Taniyama-Shimura-Weil conjecture). Theorem 25.2 (Breuil-Conrad-Diamond-Taylor). Every elliptic curve E=Q is modular. Our goal in this lecture is to explain what it means for an elliptic curve over Q to be modular (we will also define the term semistable). This requires us to delve briefly into the theory of modular forms. Our goal in doing so is simply to understand the definitions and the terminology; we will omit all but the most straight-forward proofs. 25.1 Modular forms Definition 25.3. A holomorphic function f : H ! C is a weak modular form of weight k for a congruence subgroup Γ if f(γτ) = (cτ + d)kf(τ) a b for all γ = c d 2 Γ. The j-function j(τ) is a weak modular form of weight 0 for SL2(Z), and j(Nτ) is a weak modular form of weight 0 for Γ0(N). For an example of a weak modular form of positive weight, recall the Eisenstein series X0 1 X0 1 G (τ) := G ([1; τ]) := = ; k k !k (m + nτ)k !2[1,τ] m;n2Z 1 which, for k ≥ 3, is a weak modular form of weight k for SL2(Z). -
Lectures on the Combinatorial Structure of the Moduli Spaces of Riemann Surfaces
LECTURES ON THE COMBINATORIAL STRUCTURE OF THE MODULI SPACES OF RIEMANN SURFACES MOTOHICO MULASE Contents 1. Riemann Surfaces and Elliptic Functions 1 1.1. Basic Definitions 1 1.2. Elementary Examples 3 1.3. Weierstrass Elliptic Functions 10 1.4. Elliptic Functions and Elliptic Curves 13 1.5. Degeneration of the Weierstrass Elliptic Function 16 1.6. The Elliptic Modular Function 19 1.7. Compactification of the Moduli of Elliptic Curves 26 References 31 1. Riemann Surfaces and Elliptic Functions 1.1. Basic Definitions. Let us begin with defining Riemann surfaces and their moduli spaces. Definition 1.1 (Riemann surfaces). A Riemann surface is a paracompact Haus- S dorff topological space C with an open covering C = λ Uλ such that for each open set Uλ there is an open domain Vλ of the complex plane C and a homeomorphism (1.1) φλ : Vλ −→ Uλ −1 that satisfies that if Uλ ∩ Uµ 6= ∅, then the gluing map φµ ◦ φλ φ−1 (1.2) −1 φλ µ −1 Vλ ⊃ φλ (Uλ ∩ Uµ) −−−−→ Uλ ∩ Uµ −−−−→ φµ (Uλ ∩ Uµ) ⊂ Vµ is a biholomorphic function. Remark. (1) A topological space X is paracompact if for every open covering S S X = λ Uλ, there is a locally finite open cover X = i Vi such that Vi ⊂ Uλ for some λ. Locally finite means that for every x ∈ X, there are only finitely many Vi’s that contain x. X is said to be Hausdorff if for every pair of distinct points x, y of X, there are open neighborhoods Wx 3 x and Wy 3 y such that Wx ∩ Wy = ∅. -
Elliptic Curve Cryptography and Digital Rights Management
Lecture 14: Elliptic Curve Cryptography and Digital Rights Management Lecture Notes on “Computer and Network Security” by Avi Kak ([email protected]) March 9, 2021 5:19pm ©2021 Avinash Kak, Purdue University Goals: • Introduction to elliptic curves • A group structure imposed on the points on an elliptic curve • Geometric and algebraic interpretations of the group operator • Elliptic curves on prime finite fields • Perl and Python implementations for elliptic curves on prime finite fields • Elliptic curves on Galois fields • Elliptic curve cryptography (EC Diffie-Hellman, EC Digital Signature Algorithm) • Security of Elliptic Curve Cryptography • ECC for Digital Rights Management (DRM) CONTENTS Section Title Page 14.1 Why Elliptic Curve Cryptography 3 14.2 The Main Idea of ECC — In a Nutshell 9 14.3 What are Elliptic Curves? 13 14.4 A Group Operator Defined for Points on an Elliptic 18 Curve 14.5 The Characteristic of the Underlying Field and the 25 Singular Elliptic Curves 14.6 An Algebraic Expression for Adding Two Points on 29 an Elliptic Curve 14.7 An Algebraic Expression for Calculating 2P from 33 P 14.8 Elliptic Curves Over Zp for Prime p 36 14.8.1 Perl and Python Implementations of Elliptic 39 Curves Over Finite Fields 14.9 Elliptic Curves Over Galois Fields GF (2n) 52 14.10 Is b =0 a Sufficient Condition for the Elliptic 62 Curve6 y2 + xy = x3 + ax2 + b to Not be Singular 14.11 Elliptic Curves Cryptography — The Basic Idea 65 14.12 Elliptic Curve Diffie-Hellman Secret Key 67 Exchange 14.13 Elliptic Curve Digital Signature Algorithm (ECDSA) 71 14.14 Security of ECC 75 14.15 ECC for Digital Rights Management 77 14.16 Homework Problems 82 2 Computer and Network Security by Avi Kak Lecture 14 Back to TOC 14.1 WHY ELLIPTIC CURVE CRYPTOGRAPHY? • As you saw in Section 12.12 of Lecture 12, the computational overhead of the RSA-based approach to public-key cryptography increases with the size of the keys.