Elliptic Curves and Modular Forms
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Class Number One Problem for Imaginary Quadratic Fields
MODULAR CURVES AND THE CLASS NUMBER ONE PROBLEM JEREMY BOOHER Gauss found 9 imaginary quadratic fields with class number one, and in the early 19th century conjectured he had found all of them. It turns out he was correct, but it took until the mid 20th century to prove this. Theorem 1. Let K be an imaginary quadratic field whose ring of integers has class number one. Then K is one of p p p p p p p p Q(i); Q( −2); Q( −3); Q( −7); Q( −11); Q( −19); Q( −43); Q( −67); Q( −163): There are several approaches. Heegner [9] gave a proof in 1952 using the theory of modular functions and complex multiplication. It was dismissed since there were gaps in Heegner's paper and the work of Weber [18] on which it was based. In 1967 Stark gave a correct proof [16], and then noticed that Heegner's proof was essentially correct and in fact equiv- alent to his own. Also in 1967, Baker gave a proof using lower bounds for linear forms in logarithms [1]. Later, Serre [14] gave a new approach based on modular curve, reducing the class number + one problem to finding special points on the modular curve Xns(n). For certain values of n, it is feasible to find all of these points. He remarks that when \N = 24 An elliptic curve is obtained. This is the level considered in effect by Heegner." Serre says nothing more, and later writers only repeat this comment. This essay will present Heegner's argument, as modernized in Cox [7], then explain Serre's strategy. -
Generalization of a Theorem of Hurwitz
J. Ramanujan Math. Soc. 31, No.3 (2016) 215–226 Generalization of a theorem of Hurwitz Jung-Jo Lee1,∗ ,M.RamMurty2,† and Donghoon Park3,‡ 1Department of Mathematics, Kyungpook National University, Daegu 702-701, South Korea e-mail: [email protected] 2Department of Mathematics and Statistics, Queen’s University, Kingston, Ontario, K7L 3N6, Canada e-mail: [email protected] 3Department of Mathematics, Yonsei University, 50 Yonsei-Ro, Seodaemun-Gu, Seoul 120-749, South Korea e-mail: [email protected] Communicated by: R. Sujatha Received: February 10, 2015 Abstract. This paper is an exposition of several classical results formulated and unified using more modern terminology. We generalize a classical theorem of Hurwitz and prove the following: let 1 G (z) = k (mz + n)k m,n be the Eisenstein series of weight k attached to the full modular group. Let z be a CM point in the upper half-plane. Then there is a transcendental number z such that ( ) = 2k · ( ). G2k z z an algebraic number Moreover, z can be viewed as a fundamental period of a CM elliptic curve defined over the field of algebraic numbers. More generally, given any modular form f of weight k for the full modular group, and with ( )π k /k algebraic Fourier coefficients, we prove that f z z is algebraic for any CM point z lying in the upper half-plane. We also prove that for any σ Q Q ( ( )π k /k)σ = σ ( )π k /k automorphism of Gal( / ), f z z f z z . 2010 Mathematics Subject Classification: 11J81, 11G15, 11R42. -
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. -
Lectures on Modular Forms. Fall 1997/98
Lectures on Modular Forms. Fall 1997/98 Igor V. Dolgachev October 26, 2017 ii Contents 1 Binary Quadratic Forms1 2 Complex Tori 13 3 Theta Functions 25 4 Theta Constants 43 5 Transformations of Theta Functions 53 6 Modular Forms 63 7 The Algebra of Modular Forms 83 8 The Modular Curve 97 9 Absolute Invariant and Cross-Ratio 115 10 The Modular Equation 121 11 Hecke Operators 133 12 Dirichlet Series 147 13 The Shimura-Tanyama-Weil Conjecture 159 iii iv CONTENTS Lecture 1 Binary Quadratic Forms 1.1 The theory of modular form originates from the work of Carl Friedrich Gauss of 1831 in which he gave a geometrical interpretation of some basic no- tions of number theory. Let us start with choosing two non-proportional vectors v = (v1; v2) and w = 2 (w1; w2) in R The set of vectors 2 Λ = Zv + Zw := fm1v + m2w 2 R j m1; m2 2 Zg forms a lattice in R2, i.e., a free subgroup of rank 2 of the additive group of the vector space R2. We picture it as follows: • • • • • • •Gv • ••• •• • w • • • • • • • • Figure 1.1: Lattice in R2 1 2 LECTURE 1. BINARY QUADRATIC FORMS Let v v B(v; w) = 1 2 w1 w2 and v · v v · w G(v; w) = = B(v; w) · tB(v; w): v · w w · w be the Gram matrix of (v; w). The area A(v; w) of the parallelogram formed by the vectors v and w is given by the formula v · v v · w A(v; w)2 = det G(v; w) = (det B(v; w))2 = det : v · w w · w Let x = mv + nw 2 Λ. -
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. -
Bernhard Riemann 1826-1866
Modern Birkh~user Classics Many of the original research and survey monographs in pure and applied mathematics published by Birkh~iuser in recent decades have been groundbreaking and have come to be regarded as foun- dational to the subject. Through the MBC Series, a select number of these modern classics, entirely uncorrected, are being re-released in paperback (and as eBooks) to ensure that these treasures remain ac- cessible to new generations of students, scholars, and researchers. BERNHARD RIEMANN (1826-1866) Bernhard R~emanno 1826 1866 Turning Points in the Conception of Mathematics Detlef Laugwitz Translated by Abe Shenitzer With the Editorial Assistance of the Author, Hardy Grant, and Sarah Shenitzer Reprint of the 1999 Edition Birkh~iuser Boston 9Basel 9Berlin Abe Shendtzer (translator) Detlef Laugwitz (Deceased) Department of Mathematics Department of Mathematics and Statistics Technische Hochschule York University Darmstadt D-64289 Toronto, Ontario M3J 1P3 Gernmany Canada Originally published as a monograph ISBN-13:978-0-8176-4776-6 e-ISBN-13:978-0-8176-4777-3 DOI: 10.1007/978-0-8176-4777-3 Library of Congress Control Number: 2007940671 Mathematics Subject Classification (2000): 01Axx, 00A30, 03A05, 51-03, 14C40 9 Birkh~iuser Boston All rights reserved. This work may not be translated or copied in whole or in part without the writ- ten permission of the publisher (Birkh~user Boston, c/o Springer Science+Business Media LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter de- veloped is forbidden. -
Modular Forms, the Ramanujan Conjecture and the Jacquet-Langlands Correspondence
Appendix: Modular forms, the Ramanujan conjecture and the Jacquet-Langlands correspondence Jonathan D. Rogawski1) The theory developed in Chapter 7 relies on a fundamental result (Theorem 7 .1.1) asserting that the space L2(f\50(3) x PGLz(Op)) decomposes as a direct sum of tempered, irreducible representations (see definition below). Here 50(3) is the compact Lie group of 3 x 3 orthogonal matrices of determinant one, and r is a discrete group defined by a definite quaternion algebra D over 0 which is split at p. The embedding of r in 50(3) X PGLz(Op) is defined by identifying 50(3) and PGLz(Op) with the groups of real and p-adic points of the projective group D*/0*. Although this temperedness result can be viewed as a combinatorial state ment about the action of the Heckeoperators on the Bruhat-Tits tree associated to PGLz(Op). it is not possible at present to prove it directly. Instead, it is deduced as a corollary of two other results. The first is the Ramanujan-Petersson conjec ture for holomorphic modular forms, proved by P. Deligne [D]. The second is the Jacquet-Langlands correspondence for cuspidal representations of GL(2) and multiplicative groups of quaternion algebras [JL]. The proofs of these two results involve essentially disjoint sets of techniques. Deligne's theorem is proved using the Riemann hypothesis for varieties over finite fields (also proved by Deligne) and thus relies on characteristic p algebraic geometry. By contrast, the Jacquet Langlands Theorem is analytic in nature. The main tool in its proof is the Seiberg trace formula. -
1 Complex Theory of Abelian Varieties
1 Complex Theory of Abelian Varieties Definition 1.1. Let k be a field. A k-variety is a geometrically integral k-scheme of finite type. An abelian variety X is a proper k-variety endowed with a structure of a k-group scheme. For any point x X(k) we can defined a translation map Tx : X X by 2 ! Tx(y) = x + y. Likewise, if K=k is an extension of fields and x X(K), then 2 we have a translation map Tx : XK XK defined over K. ! Fact 1.2. Any k-group variety G is smooth. Proof. We may assume that k = k. There must be a smooth point g0 G(k), and so there must be a smooth non-empty open subset U G. Since2 G is covered by the G(k)-translations of U, G is smooth. ⊆ We now turn our attention to the analytic theory of abelian varieties by taking k = C. We can view X(C) as a compact, connected Lie group. Therefore, we start off with some basic properties of complex Lie groups. Let X be a Lie group over C, i.e., a complex manifold with a group structure whose multiplication and inversion maps are holomorphic. Let T0(X) denote the tangent space of X at the identity. By adapting the arguments from the C1-case, or combining the C1-case with the Cauchy-Riemann equations we get: Fact 1.3. For each v T0(X), there exists a unique holomorphic map of Lie 2 δ groups φv : C X such that (dφv)0 : C T0(X) satisfies (dφv)0( 0) = v. -
Congruences Between Modular Forms
CONGRUENCES BETWEEN MODULAR FORMS FRANK CALEGARI Contents 1. Basics 1 1.1. Introduction 1 1.2. What is a modular form? 4 1.3. The q-expansion priniciple 14 1.4. Hecke operators 14 1.5. The Frobenius morphism 18 1.6. The Hasse invariant 18 1.7. The Cartier operator on curves 19 1.8. Lifting the Hasse invariant 20 2. p-adic modular forms 20 2.1. p-adic modular forms: The Serre approach 20 2.2. The ordinary projection 24 2.3. Why p-adic modular forms are not good enough 25 3. The canonical subgroup 26 3.1. Canonical subgroups for general p 28 3.2. The curves Xrig[r] 29 3.3. The reason everything works 31 3.4. Overconvergent p-adic modular forms 33 3.5. Compact operators and spectral expansions 33 3.6. Classical Forms 35 3.7. The characteristic power series 36 3.8. The Spectral conjecture 36 3.9. The invariant pairing 38 3.10. A special case of the spectral conjecture 39 3.11. Some heuristics 40 4. Examples 41 4.1. An example: N = 1 and p = 2; the Watson approach 41 4.2. An example: N = 1 and p = 2; the Coleman approach 42 4.3. An example: the coefficients of c(n) modulo powers of p 43 4.4. An example: convergence slower than O(pn) 44 4.5. Forms of half integral weight 45 4.6. An example: congruences for p(n) modulo powers of p 45 4.7. An example: congruences for the partition function modulo powers of 5 47 4.8. -
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).