The theory of elliptic curves and modular forms provides a fruitful meeting ground for such diverse areas as number theory, complex analysis, algebraic geometry, and representation theory. This book starts out with a problem from elementary number theory and proceeds to lead its reader into the modern theory, covering such topics as the Hasse-Weil L-function and the conjecture of Birch and Swinnerton-Dyer. This new edition details the current state of knowledge of elliptic curves.

Many problems in number theory have simple statements, but their solutions require a deep understanding of algebra, algebraic geometry, complex analysis, group representations, or a combination of all four. The original simply stated problem can be obscured in the depth of the theory developed to understand it. This book is an introduction to some of these problems, and an overview of the theories used nowadays to attack them, presented so that the number theory is always at the forefront of the discussion. Lozano-Robledo gives an introductory survey of elliptic curves, modular forms, and $L$-functions. His main goal is to provide the reader with the big picture of the surprising connections among these three families of mathematical objects and their meaning for number theory. As a case in point, Lozano-Robledo explains the modularity theorem and its famous consequence, Fermat's Last Theorem. He also discusses the Birch and Swinnerton-Dyer Conjecture and other modern conjectures. The book begins with some motivating problems and includes numerous concrete examples throughout the text, often involving actual numbers, such as 3, 4, 5, $\frac{3344161}{747348}$, and $\frac{2244035177043369699245575130906674863160948472041} {8912332268928859588025535178967163570016480830}$. The theories of elliptic curves, modular forms, and $L$-functions are too vast to be covered in a single volume, and their proofs are outside the scope of the undergraduate curriculum. However, the primary objects of study, the statements of the main theorems, and their corollaries are within the grasp of advanced undergraduates. This book concentrates on motivating the definitions, explaining the statements of the theorems and conjectures, making connections, and providing lots of examples, rather than dwelling on the hard proofs. The book succeeds if, after reading the text, students feel compelled to study elliptic curves and modular forms in all their glory.

These lecture notes grew out of a one semester introductory course on elliptic curves given to an audience of computer science and mathematics students, and assume only minimal background knowledge. After having covered basic analytic and algebraic aspects, putting special emphasis on explaining the interplay between algebraic and analytic formulas, they go on to some more specialized topics. These include the $j$-function from an algebraic and analytic perspective, a discussion of elliptic curves over finite fields, derivation of recursion formulas for the division polynomials, the algebraic structure of the torsion points of an elliptic curve, complex multiplication, and modular forms. In an effort to motivate basic problems the book starts very slowly but considers some aspects such as modular forms of higher level which are not usually treated. It presents more than 100 exercises and a Mathematica TM notebook that treats a number of calculations involving elliptic curves. The book is aimed at students of mathematics with a general interest in elliptic curves but also at students of computer science interested in their cryptographic aspects.

Elliptic curves have played an increasingly important role in number theory and related fields over the last several decades, most notably in areas such as cryptography, factorization, and the proof of Fermat's Last Theorem. However, most books on the subject assume a rather high level of mathematical sophistication, and few are truly accessible to

"Beyond Primes" delves into the fascinating world of number theory beyond the realm of prime numbers. From exploring topics like composite numbers, perfect numbers, and cryptographically significant numbers, to investigating unsolved problems and conjectures in number theory, this book offers readers a captivating journey into the depths of mathematical exploration. With clear explanations and intriguing examples, "Beyond Primes" is an essential read for anyone interested in the beauty and complexity of number theory, offering insights into the mysteries that lie beyond the realm of primes.

From the reviews: "This is a textbook in cryptography with emphasis on algebraic methods. It is supported by many exercises (with answers) making it appropriate for a course in mathematics or computer science. [...] Overall, this is an excellent expository text, and will be very useful to both the student and researcher." Mathematical Reviews

Elliptic curves have been intensively studied in algebraic geometry and number theory. In recent years they have been used in devising efficient algorithms for factoring integers and primality proving, and in the construction of public key cryptosystems. Elliptic Curve Public Key Cryptosystems provides an up-to-date and self-contained treatment of elliptic curve-based public key cryptology. Elliptic curve cryptosystems potentially provide equivalent security to the existing public key schemes, but with shorter key lengths. Having short key lengths means smaller bandwidth and memory requirements and can be a crucial factor in some applications, for example the design of smart card systems. The book examines various issues which arise in the secure and efficient implementation of elliptic curve systems. Elliptic Curve Public Key Cryptosystems is a valuable reference resource for researchers in academia, government and industry who are concerned with issues of data security. Because of the comprehensive treatment, the book is also suitable for use as a text for advanced courses on the subject.

This book constitutes the refereed proceedings of the 10th IMA International Conference on Cryptography and Coding, held in Cirencester, UK, in December 2005. The 26 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections on coding theory, signatures and signcryption, symmetric cryptography, side channels, algebraic cryptanalysis, information theoretic applications, number theoretic foundations, and public key and ID-based encryption schemes.