DOCSLIB.ORG

The Arithmetic Behind Cryptography Gerhard Frey

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Arithmetic Behind Cryptography Gerhard Frey The Arithmetic Behind Cryptography Gerhard Frey he security of very efficient and widely list of standardized curves, for instance listed in used public key crypto systems is [NIST] or in [BRAIN]. But apart from applications based on the hardness of mathematical to elliptic curves the higher genus curves have problems. Typically such problems various applications in cryptography which we come from arithmetic. Here are three cannot describe in this short survey. Timportant examples: Find shortest or closest But it is not only the status quo which is vectors in lattices, factor large numbers, and supported. New points of view from the theoretical compute logarithms in finite groups. side lead to advances in the design of hardware as In this article we shall concentrate on the last well as in protocols. One of the striking examples is example and so cover crypto systems for which the development of pairing-based cryptography. the crypto primitive behind them is the discrete From its background, namely duality theory in logarithm (DL) in cyclic groups of prime order (see arithmetic geometry, there goes a direct path to the subsection on Diffie-Hellman Problems). very efficient implementations of pairings which The first proposal for such systems was given by allow, for instance, new ways to sign, and here Diffie and Hellman in their groundbreaking article curves of higher genus may play an important [DH]. As groups they suggested taking roots of role. unity in the multiplicative group of finite fields. Acknowledgment. The author would like to thank The generality of the methods provided by al- the referees for careful reading of the manuscript gorithmic arithmetic geometry opens immediately and for their helpful comments. a wide range of possibilities. One can replace tor- sion points in the multiplicative group by torsion Some Aspects of Arithmetic Geometry points of Jacobian varieties of curves over finite In the section “Construction of DL-Systems” we fields. But, on the other side, the strength of the shall formulate tasks for mathematicians motiva- methods allows us to develop very efficient at- ted by needs of data security. It turns out that it tacks. So most of the suggested candidates for is surprisingly difficult to find families of groups public key systems did not fulfill the expectations, which are candidates for DL-systems, and that and only DL-systems based on carefully chosen the search for bilinear structures is even more elliptic curves and curves of genus 2 survived involved. without any blame. The only known examples are constructed This does not mean that the study of curves of with the help of advanced methods of arithmetic arbitrary genus is not important for applications geometry mostly developed during the last sixty in data security. In many cases we understand years. We emphasize the remarkable fact that they partial weaknesses of elliptic curves by making both enable us to solve old problems like FLT more general objects accessible to computation. (see the subsection “Digression: FLT”) and lead to The continuous study of consequences of advan- efficient and secure families of public key crypto ces in algorithmic arithmetic geometry for the systems. security of used crypto system and failures of at- tacks give mathematicians a better conscience and What Is Arithmetic Geometry? users more trust. So even people only involved in Arithmetic geometry is one of the most powerful designing systems without being interested in the ingredients in mathematics. It combines classical theoretical background can choose (very special) algebraic number theory with algebraic geometry. cases, for example, one elliptic curve over a fixed It uses the theory of functions over C, and so field with explicit addition formulas given in a analytic geometry, and it transfers this theory to Gerhard Frey is professor of mathematics at the Univer- its p-adic counterpart, the p-adic rigid geometry. sity of Duisburg-Essen. His email address is gerhard.frey The important feature is that objects from @gmail.com. number theory, like the ring of integers, and 366 Notices of the AMS Volume 57, Number 3 objects from algebraic geometry, like varieties A fundamental tool is Minkowski’s theorem on over finite fields, can be treated in a unified way points with small norms in lattices and related (as schemes consisting of the set of points with results, for instance reduction of quadratic forms topology and sheaves of functions). For instance, following Lagrange and Gauss. The enormous the arithmetic of rings of integers in number growth of computational power made it possible fields is very similar to the arithmetic of rings of to construct interesting examples in a wide range, holomorphic functions on affine curves over finite and very often one meets the LLL algorithm as a fields. The analogy is neither only formal nor in major tool. all aspects obtained by using a dictionary, and The theoretical insights obtained by the ap- the interplay between the arithmetic world and proach described in the preceding subsection the geometric world is extremely fruitful for both made rapid and exciting progress possible in sides. the area of algorithmic arithmetic geometry, The situation becomes very interesting and ex- generalizing considerably both range and techni- tremely difficult if both points of view are mixed ques of computational number theory. Prominent together, for instance, if we look at the arith- examples are computation of tables of modular metic of curves C defined over number fields or forms including congruences, algorithmic study p-adic fields K. Geometrically these are varieties of modular curves (see, for instance, the Cremona of dimension 1, but since we can look at them tables [C] listing elliptic curves) and related Galois as being defined over the ring of integers OK of representations. K, they carry a 2-dimensional structure: from C Translating arithmetical problems into the geo- we get an arithmetical surface . This surface metric language has the immediate consequence C contains for each prime ideal p of OK a closed that one can apply the methods from arithmetic fiber p (special fiber at p) which is the reduction to the geometric case, too. And so we have now of moduloC p, that is, roughly speaking, the curve a very advanced theoretical and algorithmic tool- obtainedC by looking at the equations defining C (in kit to deal with the explicit theory of varieties a suitable normalization with respect to p) modulo over finite fields as a counterpart to the explicit p. The arithmetical surface contains much more theory of algebraic number fields. We devote the information than its genericC fiber C. It is not uni- subsection “Arithmetic in Divisor Classes” to an quely determined by C. There is an optimal model, important example. the so-called minimal model, and using this model one can try to get the arithmetical data of C from Complexity Hierarchy. A crucial part of every studying the analogous data of the special fibers. algorithmic theory is the determination of the In the case that K is a number field one tries to complexity of the available algorithms. exploit the local information one gets over the Here we can only scratch the surface of this completions at all places of K simultaneously in fascinating mathematical subject. We introduce order to get global information, for example, about Landau’s notation: rational points on C. (If K Q these completions For = f , g : N R are the reals R and, for all prime numbers p, the → p-adic numbers Qp.) If this strategy is successful with g positive define then one has established a local-global principle. f (g) One famous example of such a principle is the = O if there exists d R>0 with theorem of Hasse-Minkowski which states that ∈ one quadratic polynomial in arbitrarily many va- f (N) dg(N) riables with coefficients in a number field K has a | |≤ for all N. K-rational solution if and only if it has solutions Take α [0, 1], c R . in all fields obtained as completions with respect >0 Define ∈ ∈ to valuations of K. α 1 α We cannot expect to get such a principle for LN (α, c) : exp(c log(N) log(N) − ). = · · general varieties. In fact we already find coun- For (almost all) N N, let terexamples if we look at the set of solutions ∈ fN : AN BN of two quadratic equations or of polynomials in → two variables of degree 3. But there is a Galois be maps from sets AN to sets BN . Assume that there theoretical variant which relates local with global is an algorithm which evaluates fN with (probabi- information: the density theorem of Cebotarevˇ listic) complexity (e.g., number of bit operations (Theorem 2.5). needed) F(N). Then the (probabilistic) asymptotic complexity Algorithmic Arithmetic Geometry of the family fN is called Classically algorithmic aspects of number theory polynomial if F (LN (0, c)) (“fast algo- mostly deal with lattices and derived objects. • rithm”) = O March 2010 Notices of the AMS 367 exponential if F (LN (1, c)) (“hard algo- Inside of I(OC ) we have the subgroup Princ(OC ) • = O rithm”) and of principal ideals f OC , f F ∗. The quotient · ∈ C subexponential if there is 0 < α < 1 with group • F (LN (α, c)) Pic(OC ) : I(OC )/Princ(OC ) = O = in log(N). is the ideal class group of OC . It is in a natural Subexponential complexity is a very interesting way isomorphic to Pic0(C), the divisor class group case between the two extremes. of degree 0 of C, and a fundamental theorem Caution: This notion of complexity is an as- of the theory of curves states that Pic0(C) is in ymptotic estimate of a specific algorithm for the a functorial way isomorphic to the group of K- evaluation of fN .
Load more

Recommended publications
  • Curriculum Vitae
    CURRICULUM VITAE JANNIS A. ANTONIADIS Department of Mathematics University of Crete 71409 Iraklio,Crete Greece PERSONAL Born on 5 of September 1951 in Dryovouno Kozani, Greece. Married with Sigrid Arnz since 1983, three children : Antonios (26), Katerina (23), Karolos (21). EDUCATION-EMPLOYMENT 1969-1973: B.S. in Mathematics at the University of Thessaloniki, Greece. 1973-1976: Military Service. 1976-1979: Assistant at the University of Thessaloniki, Greece. 1979-1981: Graduate student at the University of Cologne, Germany. 1981 Ph.D. in Mathematics at the University of Cologne. Thesis advisor: Prof. Dr. Curt Meyer. 1982-1984: Lecturer at the University of Thessaloniki, Greece. 1984-1990: Associate Professor at the University of Crete, Greece. 1990-now: Professor at the University of Crete, Greece. 2003-2007 Chairman of the Department VISITING POSITIONS - University of Cologne Germany, during the period from December 1981 until Ferbruary 1983 as researcher of the German Research Council (DFG). - MPI-for Mathematics Bonn Germany, during the periods: from May until September of the year 1985, from May until September of the year 1986, from July until January of the year 1988 and from July until September of the year 1988. - University of Heidelberg Germany, during the period: from September 1993 until January 1994, as visiting Professor. University of Cyprus, during the period from January 2008 until May 2008, as visiting Professor. Again for the Summer Semester of 2009 and of the Winter Semester 2009-2010. LONG TERM VISITS: - University
    [Show full text]
  • Sir Andrew J. Wiles
    ISSN 0002-9920 (print) ISSN 1088-9477 (online) of the American Mathematical Society March 2017 Volume 64, Number 3 Women's History Month Ad Honorem Sir Andrew J. Wiles page 197 2018 Leroy P. Steele Prize: Call for Nominations page 195 Interview with New AMS President Kenneth A. Ribet page 229 New York Meeting page 291 Sir Andrew J. Wiles, 2016 Abel Laureate. “The definition of a good mathematical problem is the mathematics it generates rather Notices than the problem itself.” of the American Mathematical Society March 2017 FEATURES 197 239229 26239 Ad Honorem Sir Andrew J. Interview with New The Graduate Student Wiles AMS President Kenneth Section Interview with Abel Laureate Sir A. Ribet Interview with Ryan Haskett Andrew J. Wiles by Martin Raussen and by Alexander Diaz-Lopez Allyn Jackson Christian Skau WHAT IS...an Elliptic Curve? Andrew Wiles's Marvelous Proof by by Harris B. Daniels and Álvaro Henri Darmon Lozano-Robledo The Mathematical Works of Andrew Wiles by Christopher Skinner In this issue we honor Sir Andrew J. Wiles, prover of Fermat's Last Theorem, recipient of the 2016 Abel Prize, and star of the NOVA video The Proof. We've got the official interview, reprinted from the newsletter of our friends in the European Mathematical Society; "Andrew Wiles's Marvelous Proof" by Henri Darmon; and a collection of articles on "The Mathematical Works of Andrew Wiles" assembled by guest editor Christopher Skinner. We welcome the new AMS president, Ken Ribet (another star of The Proof). Marcelo Viana, Director of IMPA in Rio, describes "Math in Brazil" on the eve of the upcoming IMO and ICM.
    [Show full text]
  • A Glimpse of the Laureate's Work
    A glimpse of the Laureate’s work Alex Bellos Fermat’s Last Theorem – the problem that captured planets moved along their elliptical paths. By the beginning Andrew Wiles’ imagination as a boy, and that he proved of the nineteenth century, however, they were of interest three decades later – states that: for their own properties, and the subject of work by Niels Henrik Abel among others. There are no whole number solutions to the Modular forms are a much more abstract kind of equation xn + yn = zn when n is greater than 2. mathematical object. They are a certain type of mapping on a certain type of graph that exhibit an extremely high The theorem got its name because the French amateur number of symmetries. mathematician Pierre de Fermat wrote these words in Elliptic curves and modular forms had no apparent the margin of a book around 1637, together with the connection with each other. They were different fields, words: “I have a truly marvelous demonstration of this arising from different questions, studied by different people proposition which this margin is too narrow to contain.” who used different terminology and techniques. Yet in the The tantalizing suggestion of a proof was fantastic bait to 1950s two Japanese mathematicians, Yutaka Taniyama the many generations of mathematicians who tried and and Goro Shimura, had an idea that seemed to come out failed to find one. By the time Wiles was a boy Fermat’s of the blue: that on a deep level the fields were equivalent. Last Theorem had become the most famous unsolved The Japanese suggested that every elliptic curve could be problem in mathematics, and proving it was considered, associated with its own modular form, a claim known as by consensus, well beyond the reaches of available the Taniyama-Shimura conjecture, a surprising and radical conceptual tools.
    [Show full text]
  • Arxiv:Math/9807081V1 [Math.AG] 16 Jul 1998 Hthsbffldtewrdsbs Id O 5 Er Otl Bed-Time Tell to Years Olivia
    Oration for Andrew Wiles Fanfare We honour Andrew Wiles for his supreme contribution to number theory, a contribution that has made him the world’s most famous mathematician and a beacon of inspiration for students of math; while solving Fermat’s Last Theorem, for 350 years the most celebrated open problem in mathematics, Wiles’s work has also dramatically opened up whole new areas of research in number theory. A love of mathematics The bulk of this eulogy is mathematical, for which I make no apology. I want to stress here that, in addition to calculations in which each line is correctly deduced from the preceding lines, mathematics is above all passion and drama, obsession with solving the unsolvable. In a modest way, many of us at Warwick share Andrew Wiles’ overriding passion for mathematics and its unsolved problems. Three short obligatory pieces Biography Oxford, Cambridge, Royal Society Professor at Oxford from arXiv:math/9807081v1 [math.AG] 16 Jul 1998 1988, Professor at Princeton since 1982 (lamentably for maths in Britain). Very many honours in the last 5 years, including the Wolf prize, Royal Society gold medal, the King Faisal prize, many, many others. Human interest story The joy and pain of Wiles’s work on Fermat are beautifully documented in John Lynch’s BBC Horizon documentary; I par- ticularly like the bit where Andrew takes time off from unravelling the riddle that has baffled the world’s best minds for 350 years to tell bed-time stories to little Clare, Kate and Olivia. 1 Predictable barbed comment on Research Assessment It goes with- out saying that an individual with a total of only 14 publications to his credit who spends 7 years sulking in his attic would be a strong candidate for early retirement at an aggressive British research department.
    [Show full text]
  • Fermat's Last Theorem, a Theorem at Last
    August 1993 MAA FOCUS Fermat’s Last Theorem, that one could understand the elliptic curve given by the equation a Theorem at Last 2 n n y = x(x − a )( x + b ) Keith Devlin, Fernando Gouvêa, and Andrew Granville in the way proposed by Taniyama. After defying all attempts at a solution for Wiles’ approach comes from a somewhat Following an appropriate re-formulation 350 years, Fermat’s Last Theorem finally different direction, and rests on an amazing by Jean-Pierre Serre in Paris, Kenneth took its place among the known theorems of connection, established during the last Ribet in Berkeley strengthened Frey’s mathematics in June of this year. decade, between the Last Theorem and the original concept to the point where it was theory of elliptic curves, that is, curves possible to prove that the existence of a On June 23, during the third of a series of determined by equations of the form counter example to the Last Theorem 2 3 lectures at a conference held at the Newton y = x + ax + b, would lead to the existence of an elliptic Institute in Cambridge, British curve which could not be modular, and mathematician Dr. Andrew Wiles, of where a and b are integers. hence would contradict the Shimura- Princeton University, sketched a proof of the Taniyama-Weil conjecture. Shimura-Taniyama-Weil conjecture for The path that led to the June 23 semi-stable elliptic curves. As Kenneth announcement began in 1955 when the This is the point where Wiles entered the Ribet, of the University of California at Japanese mathematician Yutaka Taniyama picture.
    [Show full text]
  • Fermat's Last Theorem and Andrew Wiles
    Fermat's last theorem and Andrew Wiles © 1997−2009, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non−commercial use. For other uses, including electronic redistribution, please contact us. June 2008 Features Fermat's last theorem and Andrew Wiles by Neil Pieprzak This article is the winner of the schools category of the Plus new writers award 2008. Students were asked to write about the life and work of a mathematician of their choice. "But the best problem I ever found, I found in my local public library." Andrew Wiles. Image © C. J. Mozzochi, Princeton N.J. There is a problem that not even the collective mathematical genius of almost 400 years could solve. When the ten−year−old Andrew Wiles read about it in his local Cambridge library, he dreamt of solving the problem that had haunted so many great mathematicians. Little did he or the rest of the world know that he would succeed... Fermat's last theorem and Andrew Wiles 1 Fermat's last theorem and Andrew Wiles "Here was a problem, that I, a ten−year−old, could understand and I knew from that moment that I would never let it go. I had to solve it." Pierre de Fermat The story of the problem that would seal Wiles' place in history begins in 1637 when Pierre de Fermat made a deceptively simple conjecture. He stated that if is any whole number greater than 2, then there are no three whole numbers , and other than zero that satisfy the equation (Note that if , then whole number solutions do exist, for example , and .) Fermat claimed to have proved this statement but that the "margin [was] too narrow to contain" it.
    [Show full text]
  • On Galois Representations in Theory and Praxis Gerhard Frey, University of Duisburg-Essen
    On Galois Representations in Theory and Praxis Gerhard Frey, University of Duisburg-Essen One of the most astonishing success stories in recent mathematics is arithmetic geo- metry, which unifies methods from classical number theory with algebraic geometry (\schemes"). In this context an extremely important role is played by the Galois groups of base schemes like rings of integers of number fields or rings of holomor- phic functions of curves over finite fields. These groups are the algebraic analogues of topological fundamental groups, and their representations induced by the action on divisor class groups of varieties over these domains yield spectacular results like Serre's Conjecture for two-dimensional representations of the Galois group of Q, which implies for example the modularity of elliptic curves over Q and so Fermat's Last Theorem (and much more). At the same time the algorithmic aspect of arithmetical objects like lattices and ideal class groups of global fields becomes more and more important and accessible, stimulated by and stimulating the advances in theory. An outstanding result is the theorem of F. Heß and C.Diem yielding that the addition in divisor class groups of curves of genus g over finite fields Fq is (probabilistically) of polynomial complexity in g ( fixed) and log(q)(g fixed). So one could hope to use such groups for public key cryptography, e.g. for key exchange, as established by Diffie-Hellman for the multiplicative group of finite fields. But the obtained insights play not only a constructive role but also a destructive role for the security of such systems.
    [Show full text]
  • Sir Andrew Wiles Awarded Abel Prize
    Sir Andrew J. Wiles Awarded Abel Prize Elaine Kehoe with The Norwegian Academy of Science and Letters official Press Release ©Abelprisen/DNVA/Calle Huth. Courtesy of the Abel Prize Photo Archive. ©Alain Goriely, University of Oxford. Courtesy the Abel Prize Photo Archive. Sir Andrew Wiles received the 2016 Abel Prize at the Oslo award ceremony on May 24. The Norwegian Academy of Science and Letters has carries a cash award of 6,000,000 Norwegian krone (ap- awarded the 2016 Abel Prize to Sir Andrew J. Wiles of the proximately US$700,000). University of Oxford “for his stunning proof of Fermat’s Citation Last Theorem by way of the modularity conjecture for Number theory, an old and beautiful branch of mathemat- semistable elliptic curves, opening a new era in number ics, is concerned with the study of arithmetic properties of theory.” The Abel Prize is awarded by the Norwegian Acad- the integers. In its modern form the subject is fundamen- tally connected to complex analysis, algebraic geometry, emy of Science and Letters. It recognizes contributions of and representation theory. Number theoretic results play extraordinary depth and influence to the mathematical an important role in our everyday lives through encryption sciences and has been awarded annually since 2003. It algorithms for communications, financial transactions, For permission to reprint this article, please contact: and digital security. [email protected]. Fermat’s Last Theorem, first formulated by Pierre de DOI: http://dx.doi.org/10.1090/noti1386 Fermat in the seventeenth century, is the assertion that 608 NOTICES OF THE AMS VOLUME 63, NUMBER 6 the equation xn+yn=zn has no solutions in positive integers tophe Breuil, Brian Conrad, Fred Diamond, and Richard for n>2.
    [Show full text]
  • Relations Between Arithmetic Geometry and Public Key Cryptography
    Advances in Mathematics of Communications doi:10.3934/amc.2010.4.281 Volume 4, No. 2, 2010, 281–305 RELATIONS BETWEEN ARITHMETIC GEOMETRY AND PUBLIC KEY CRYPTOGRAPHY Gerhard Frey Institute for Experimental Mathematics University of Duisburg-Essen Ellernstrasse 29, 45326 Essen, Germany (Communicated by Ian Blake) Abstract. In the article we shall try to give an overview of the interplay between the design of public key cryptosystems and algorithmic arithmetic geometry. We begin in Section 2 with a very abstract setting and try to avoid all structures which are not necessary for protocols like Diffie-Hellman key exchange, ElGamal signature and pairing based cryptography (e.g. short signatures). As an unavoidable consequence of the generality the result is difficult to read and clumsy. But nevertheless it may be worthwhile because there are suggestions for systems which do not use the full strength of group structures (see Subsection 2.2.1) and it may motivate to look for alternatives to known group-based systems. But, of course, the main part of the article deals with the usual realization by discrete logarithms in groups, and the main source for cryptographically useful groups are divisor class groups. We describe advances concerning arithmetic in such groups attached to curves over finite fields including addition and point counting which have an immediate application to the construction of cryptosystems. For the security of these systems one has to make sure that the computation of the discrete logarithm is hard. We shall see how methods from arithmetic geometry narrow the range of candidates usable for cryptography considerably and leave only carefully chosen curves of genus 1 and 2 without flaw.
    [Show full text]
  • On Bilinear Structures on Divisor Class Groups
    ANNALES MATHÉMATIQUES BLAISE PASCAL Gerhard Frey On Bilinear Structures on Divisor Class Groups Volume 16, no 1 (2009), p. 1-26. <http://ambp.cedram.org/item?id=AMBP_2009__16_1_1_0> © Annales mathématiques Blaise Pascal, 2009, tous droits réservés. L’accès aux articles de la revue « Annales mathématiques Blaise Pas- cal » (http://ambp.cedram.org/), implique l’accord avec les condi- tions générales d’utilisation (http://ambp.cedram.org/legal/). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Publication éditée par le laboratoire de mathématiques de l’université Blaise-Pascal, UMR 6620 du CNRS Clermont-Ferrand — France cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Annales mathématiques Blaise Pascal 16, 1-26 (2009) On Bilinear Structures on Divisor Class Groups Gerhard Frey Abstract It is well known that duality theorems are of utmost importance for the arith- metic of local and global fields and that Brauer groups appear in this context unavoidably. The key word here is class field theory. In this paper we want to make evident that these topics play an important role in public key cryptopgraphy, too. Here the key words are Discrete Logarithm systems with bilinear structures. Almost all public key crypto systems used today based on discrete logarithms use the ideal class groups of rings of holomorphic functions of affine curves over finite fields Fq to generate the underlying groups. We explain in full generality how these groups can be mapped to Brauer groups of local fields via the Lichtenbaum- Tate pairing, and we give an explicit description.
    [Show full text]
  • 26 Fermat's Last Theorem
    18.783 Elliptic Curves Spring 2019 Lecture #26 05/15/2019 26 Fermat’s Last Theorem In this final lecture we give an overview of the proof of Fermat’s Last Theorem. Our goal is to explain exactly what Andrew Wiles [18], with the assistance of Richard Taylor [17], proved, and why it implies Fermat’s Last Theorem. This implication is a consequence of earlier work by several mathematicians, including Richard Frey, Jean-Pierre Serre, and Ken Ribet. We will say very little about the details of Wiles’ proof, which are beyond the scope of this course, but we will provide references for those who wish to learn more. 26.1 Fermat’s Last Theorem In 1637, Pierre de Fermat famously wrote in the margin of a copy of Diophantus’ Arithmetica that the equation xn + yn = zn has no integer solutions with xyz 6= 0 and n > 2, and claimed to have a remarkable proof of this fact. As with most of Fermat’s work, he never published this claim (mathematics was a hobby for Fermat, he was a lawyer by trade). Fermat’s marginal comment was apparently discovered only after his death, when his son Samuel was preparing to publish Fermat’s mathematical correspondence, but it soon became well known and is included as commentary in later printings of Arithmetica. Fermat did prove the case n = 4, using a descent argument. It then suffices to consider n n n only cases where n is an odd prime, since if pjn and (x0; y0; z0) is a solution to x + y = z , n=p n=p n=p p p p then (x0 ; y0 ; z0 ) is a solution to x + y = z .
    [Show full text]
  • An Overview of the Proof of Fermat's Last Theorem Glenn Stevens The
    An Overview of the Proof of Fermat’s Last Theorem Glenn Stevens The principal aim of this article is to sketch the proof of the following famous assertion. Fermat’s Last Theorem. For n > 2, we have an + bn = cn FLT(n) : = abc = 0. a, b, c Z ) 2 Many special cases of Fermat’s Last Theorem were proved from the 17th through the 19th centuries. The first known case is due to Fermat himself, who proved FLT(4) around 1640. FLT(3) was proved by Euler between 1758 and 1770. Since FLT(d) = FLT(n) whenever d n, the re- sults of Euler and Fermat immediately reduce) our theorem to the| following assertion. Theorem. If p 5 is prime, and a, b, c Z, then ap + bp + cp = 0 = abc = 0. ≥ 2 ) The proof of this theorem is the result of the combined e↵orts of innumer- able mathematicians who have worked over the last century (and more!) to develop a rich and powerful arithmetic theory of elliptic curves, modular forms, and galois representations. It seems appropriate to emphasize the names of five individuals who had the insight to see how this theory could be used to prove Fermat’s Last Theorem and to supply the final crucial ingredients of the proof: Gerhart Frey (1985), who first suggested that the existence of a solu- tion of the Fermat equation might contradict the Modularity Conjecture of Taniyama, Shimura, and Weil; Jean-Pierre Serre (1985-6), who formulated and (with J.-F. Mestre) tested numerically a precise conjecture about modular forms and galois rep- resentations mod p and who showed how a small piece of this conjecture— the so-called epsilon conjecture—together
    [Show full text]