25 Modular Forms and L-Series
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
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. -
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. -
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. -
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. -
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. -
Elliptic Curves, Modular Forms, and L-Functions Allison F
Claremont Colleges Scholarship @ Claremont HMC Senior Theses HMC Student Scholarship 2014 There and Back Again: Elliptic Curves, Modular Forms, and L-Functions Allison F. Arnold-Roksandich Harvey Mudd College Recommended Citation Arnold-Roksandich, Allison F., "There and Back Again: Elliptic Curves, Modular Forms, and L-Functions" (2014). HMC Senior Theses. 61. https://scholarship.claremont.edu/hmc_theses/61 This Open Access Senior Thesis is brought to you for free and open access by the HMC Student Scholarship at Scholarship @ Claremont. It has been accepted for inclusion in HMC Senior Theses by an authorized administrator of Scholarship @ Claremont. For more information, please contact [email protected]. There and Back Again: Elliptic Curves, Modular Forms, and L-Functions Allison Arnold-Roksandich Christopher Towse, Advisor Michael E. Orrison, Reader Department of Mathematics May, 2014 Copyright c 2014 Allison Arnold-Roksandich. The author grants Harvey Mudd College and the Claremont Colleges Library the nonexclusive right to make this work available for noncommercial, educational purposes, provided that this copyright statement appears on the reproduced ma- terials and notice is given that the copying is by permission of the author. To dis- seminate otherwise or to republish requires written permission from the author. Abstract L-functions form a connection between elliptic curves and modular forms. The goals of this thesis will be to discuss this connection, and to see similar connections for arithmetic functions. Contents Abstract iii Acknowledgments xi Introduction 1 1 Elliptic Curves 3 1.1 The Operation . .4 1.2 Counting Points . .5 1.3 The p-Defect . .8 2 Dirichlet Series 11 2.1 Euler Products . -
Algebraic Surfaces Sep
Algebraic surfaces Sep. 17, 2003 (Wed.) 1. Comapct Riemann surface and complex algebraic curves This section is devoted to illustrate the connection between compact Riemann surface and complex algebraic curve. We will basically work out the example of elliptic curves and leave the general discussion for interested reader. Let Λ C be a lattice, that is, Λ = Zλ1 + Zλ2 with C = Rλ1 + Rλ2. Then an ⊂ elliptic curve E := C=Λ is an abelian group. On the other hand, it’s a compact Riemann surface. One would like to ask whether there are holomorphic function or meromorphic functions on E or not. To this end, let π : C E be the natural map, which is a group homomorphism (algebra), holomorphic function! (complex analysis), and covering (topology). A function f¯ on E gives a function f on C which is double periodic, i.e., f(z + λ1) = f(z); f(z + λ2) = f(z); z C: 8 2 Recall that we have the following Theorem 1.1 (Liouville). There is no non-constant bounded entire function. Corollary 1.2. There is no non-constant holomorphic function on E. Proof. First note that if f¯ is a holomorphic function on E, then it induces a double periodic holomorphic function on C. It then suffices to claim that a a double periodic holomorphic function on C is bounded. To do this, consider := z = α1λ1 + α2λ2 0 αi 1 . The image of f is f(D). However, D is compact,D f so is f(D) and hencej ≤f(D)≤ is bounded.g By Liouville theorem, f is constant and hence so is f¯. -
The Role of the Ramanujan Conjecture in Analytic Number Theory
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 50, Number 2, April 2013, Pages 267–320 S 0273-0979(2013)01404-6 Article electronically published on January 14, 2013 THE ROLE OF THE RAMANUJAN CONJECTURE IN ANALYTIC NUMBER THEORY VALENTIN BLOMER AND FARRELL BRUMLEY Dedicated to the 125th birthday of Srinivasa Ramanujan Abstract. We discuss progress towards the Ramanujan conjecture for the group GLn and its relation to various other topics in analytic number theory. Contents 1. Introduction 267 2. Background on Maaß forms 270 3. The Ramanujan conjecture for Maaß forms 276 4. The Ramanujan conjecture for GLn 283 5. Numerical improvements towards the Ramanujan conjecture and applications 290 6. L-functions 294 7. Techniques over Q 298 8. Techniques over number fields 302 9. Perspectives 305 J.-P. Serre’s 1981 letter to J.-M. Deshouillers 307 Acknowledgments 313 About the authors 313 References 313 1. Introduction In a remarkable article [111], published in 1916, Ramanujan considered the func- tion ∞ ∞ Δ(z)=(2π)12e2πiz (1 − e2πinz)24 =(2π)12 τ(n)e2πinz, n=1 n=1 where z ∈ H = {z ∈ C |z>0} is in the upper half-plane. The right hand side is understood as a definition for the arithmetic function τ(n) that nowadays bears Received by the editors June 8, 2012. 2010 Mathematics Subject Classification. Primary 11F70. Key words and phrases. Ramanujan conjecture, L-functions, number fields, non-vanishing, functoriality. The first author was supported by the Volkswagen Foundation and a Starting Grant of the European Research Council. The second author is partially supported by the ANR grant ArShiFo ANR-BLANC-114-2010 and by the Advanced Research Grant 228304 from the European Research Council.