Showing all 18 results
Minimal prerequisites make this text ideal for a first course in number theory. Written in a lively, engaging style by the author of popular mathematics books, it features nearly 1,000 imaginative exercises and problems. Solutions to many of the problems are included, and a teacher’s guide is available. 1978 edition.
This book provides the first systematic treatment of modules over discrete valuation domains which plays an important role in various areas of algebra, especially in commutative algebra. Many important results representing the state of the art are presented in the text which is supplemented by exercises and interesting open problems. An important contribution to commutative algebra.
"Theory of Numbers: A Textbook" is aimed at students of Mathematics who are graduates or even undergraduates. Very little prerequisites are needed. The reader is expected to know the theory of functions of a real variable and in some chapters complex integration and some simple principles of complex function theory are assumed. The entire book is self contained except theorems 7 and 9 of chapter 11 which are assumed. The most ambitious chapter is chapter 11 where the most attractive result on difference between consecutive primes is proved.
This book represents the proceedings of a workshop on elliptic curves held in St. Adele, Quebec, in February 1992. Containing both expository and research articles on the theory of elliptic curves, this collection covers a range of topics, from Langlands’s theory to the algebraic geometry of elliptic curves, from Iwasawa theory to computational aspects of elliptic curves. This book is especially significant in that it covers topics comprising the main ingredients in Andrew Wiles’s recent result on Fermat’s Last Theorem.
This book provides a summary of recent developments and the early stages of the theory of automorphic L-functions in a way that makes the subject accessible to both experts and non-experts. There are three different methods that have proved successful in studying these L-functions, two of which deal directly with their analytic properties. This book discusses the development and history of these two methods.
We use addition on a daily basis–yet how many of us stop to truly consider the enormous and remarkable ramifications of this mathematical activity? Summing It Up uses addition as a springboard to present a fascinating and accessible look at numbers and number theory, and how we apply beautiful numerical properties to answer math problems. Mathematicians Avner Ash and Robert Gross explore addition’s most basic characteristics as well as the addition of squares and other powers before moving onward to infinite series, modular forms, and issues at the forefront of current mathematical research.A
Putnam and Beyond takes the reader on a journey through the world of college mathematics, focusing on some of the most important concepts and results in the theories of polynomials, linear algebra, real analysis in one and several variables, differential equations, coordinate geometry, trigonometry, elementary number theory, combinatorics, and probability.
Neal Koblitz is a co-inventor of one of the two most popular forms of encryption and digital signature, and his autobiographical memoirs are collected in this volume.
This book provides a lucid exposition of the connections between non-commutative geometry and the famous Riemann Hypothesis, focusing on the theory of one-dimensional varieties over a finite field. The reader will encounter many important aspects of the theory, such as Bombieri’s proof of the Riemann Hypothesis for function fields, along with an explanation of the connections with Nevanlinna theory and non-commutative geometry. The connection with non-commutative geometry is given special attention, with a complete determination of the Weil terms in the explicit formula for the point counting function as a trace of a shift operator on the additive space, and a discussion of how to obtain the explicit formula from the action of the idele class group on the space of adele classes.
This popular account of set theory and mathematical logic introduces the reader to modern ideas about infinity and their implications for mathematics. It unifies ideas from set theory and mathematical logic and traces their effects on mainstream mathematical topics of today, such as number theory and combinatorics.The treatment is historical and partly informal, but with due attention to the subtleties of the subject. Ideas are shown to evolve from natural mathematical questions about the nature of infinity and the nature of proof, set against a background of broader questions and developments in mathematics.
From one of the foremost interpreters for lay readers of the history and meaning of mathematics: a stimulating account of the origins of mathematical thought and the development of numerical theory. It probes the work of Pythagoras, Galileo, Berkeley, Einstein, and others, exploring how "number magic" has influenced religion, philosophy, science, and mathematics
The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature. Addressing this gap, Algebraic Curves in Cryptography explores the rich uses of algebraic curves in a range of cryptographic applications, such as secret sharing, frameproof codes, and broadcast encryption.Suitable for researchers and graduate students in mathematics and computer science, this self-contained book is one of the first to focus on many topics in cryptography involving algebraic curves.
Prime numbers are beautiful, mysterious, and beguiling mathematical objects. The mathematician Bernhard Riemann made a celebrated conjecture about primes in 1859, the so-called Riemann Hypothesis, which remains to be one of the most important unsolved problems in mathematics. Through the deep insights of the authors, this book introduces primes and explains the Riemann Hypothesis. Students with minimal mathematical background and scholars alike will enjoy this comprehensive discussion of primes.
The main goal of this book is to present the so-called birational Arakelov geometry, which can be viewed as an arithmetic analog of the classical birational geometry, i.e., the study of big linear series on algebraic varieties. After explaining classical results about the geometry of numbers, the author starts with Arakelov geometry for arithmetic curves, and continues with Arakelov geometry of arithmetic surfaces and higher-dimensional varieties. The book includes such fundamental results as arithmetic Hilbert-Samuel formula, arithmetic Nakai-Moishezon criterion, arithmetic Bogomolov inequality, the existence of small sections, the continuity of arithmetic volume function, the Lang-Bogomolov conjecture and so on.
Cryptography is a key technology in electronic key systems. It is used to keep data secret, digitally sign documents, access control, etc. Therefore, users should not only know how its techniques work, but they must also be able to estimate their efficiency and security. For this new edition, the author has updated the discussion of the security of encryption and signature schemes and recent advances in factoring and computing discrete logarithms. He has also added descriptions of time-memory trade of attacks and algebraic attacks on block ciphers, the Advanced Encryption Standard, the Secure Hash Algorithm, secret sharing schemes, and undeniable and blind signatures.
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research.
Discusses latest results in the subjects of computation, cryptography and network securityContains discussion from a converging range of interdisciplinary fields with a large breadth of technological applicationsDevelops courses of action or methodologies to reconcile the issues identifiedFrom the Back CoverAnalysis, assessment, and data management are core competencies for operation research analysts. This volume addresses a number of issues and developed methods for improving those skills. It is an outgrowth of a conference held in April 2013 at the Hellenic Military Academy, and brings together a broad variety of mathematical methods and theories with several applications.
This introduction to cryptography employs a programming-oriented approach to study the most important cryptographic schemes in current use and the main cryptanalytic attacks against them. Discussion of the theoretical aspects, emphasizing precise security definitions based on methodological tools such as complexity and randomness, and of the mathematical aspects, with emphasis on number-theoretic algorithms and their applications to cryptography and cryptanalysis, is integrated with the programming approach, thus providing implementations of the algorithms and schemes as well as examples of realistic size.
A distinctive feature of the author’s approach is the use of Maple as a programming environment in which not just the cryptographic primitives but also the most important cryptographic schemes are implemented following the recommendations of standards bodies such as NIST, with many of the known cryptanalytic attacks implemented as well. The purpose of the Maple implementations is to let the reader experiment and learn, and for this reason the author includes numerous examples. The book discusses important recent subjects such as homomorphic encryption, identity-based cryptography and elliptic curve cryptography. The algorithms and schemes which are treated in detail and implemented in Maple include AES and modes of operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin, Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In addition, some recently introduced schemes enjoying strong security properties, such as RSA-OAEP, Rabin-SAEP, Cramer–Shoup, and PSS, are also discussed and implemented. On the cryptanalysis side, Maple implementations and examples are used to discuss many important algorithms, including birthday and man-in-the-middle attacks, integer factorization algorithms such as Pollard’s rho and the quadratic sieve, and discrete log algorithms such as baby-step giant-step, Pollard’s rho, Pohlig–Hellman and the index calculus method.
This textbook is suitable for advanced undergraduate and graduate students of computer science, engineering and mathematics, satisfying the requirements of various types of courses: a basic introductory course; a theoretically oriented course whose focus is on the precise definition of security concepts and on cryptographic schemes with reductionist security proofs; a practice-oriented course requiring little mathematical background and with an emphasis on applications; or a mathematically advanced course addressed to students with a stronger mathematical background. The main prerequisite is a basic knowledge of linear algebra and elementary calculus, and while some knowledge of probability and abstract algebra would be helpful, it is not essential because the book includes the necessary background from these subjects and, furthermore, explores the number-theoretic material in detail. The book is also a comprehensive reference and is suitable for self-study by practitioners and programmers.
Showing all 18 results