Book Description
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 senior undergraduate or beginning graduate students. Assuming only a modest background in elementary number theory, groups, and fields, Elliptic Curves: Number Theory and Cryptography introduces both the cryptographic and number theoretic sides of elliptic curves, interweaving the theory of elliptic curves with their applications. The author introduces elliptic curves over finite fields early in the treatment, leading readers directly to the intriguing cryptographic applications, but the book is structured so that readers can explore the number theoretic aspects independently if desired. By side-stepping algebraic geometry in favor an approach based on basic formulas, this book clearly demonstrates how elliptic curves are used and opens the doors to higher-level studies. Elliptic Curves offers a solid introduction to the mathematics and applications of elliptic curves that well prepares its readers to tackle more advanced problems in cryptography and number theory.
Customer Reviews:
Washington Elliptic Curves.......2007-01-12
I bought this book as a follow-up to working my way through "Introduction to Cryptography with Coding Theory" (by the same author together Wade Trappe) (which I strongly recommend as well). I was not disappointed - Washington covers a difficult but important topic in a masterly fashion which should be accessible to anyone with a serious interest in elliptic curve cryptography. It successfully follows a middle road between the standard, but rather abstract texts on number theory and those which give details of algorithms but few proofs. There are ample examples and enjoyable exercises. Strongly recommended.
Solid intermediate introduction to elliptic curves.......2006-06-12
I compare this book to Rational Points on Elliptic Curves (RP) by Tate and Silverman, and The Arithmetic of Ellipitic Curves (AEC) by Silverman.
RP is definitely for junior and senior undergraduates interested in elliptic curves. With modest knowledge of real and complex analysis (calculus and some complex calculus), RP introduces the concept of elliptic curves and presents many interesting results. Unfortunately, a lot of hand waving goes on, i.e., many results are merely stated, instead of proved.
AEC is definitely for graduate students who have all ready taken the graduate algebra and geometry sequences. A lot of high powered mathematics is used in this text to get at the heart of elliptic curves.
Washington's book falls right in between these two books. He assumes knowledge of some analysis and algebra (particulary abelian groups), then develops much of what else is needed. Some hand waving exists (mainly for some of the high powered projective geometry needed to fully understand the geometry of elliptic curves) in this book, but this does not detract from the understanding of the additive group on elliptic curves, the primary focus of the book.
For those with a basic handle on real analysis and group theory, this book can easily be used for self-teaching.
A clear, concise introduction to elliptic curves.......2006-02-20
I used this book as my main resource when writing my undergraduate dissertation on elliptic curve group structure. Although once I wanted to have a more in-depth look into any particular subject I had to chase up the references, this book made an excellent starting point. This book is a solid, clear introduction to the subject, which can be easily understood even by maths undergrads in the later years of their study (though if you're not a mathematician you may find it hard going!!) I found it be the clearest textbook on elliptic curves I came across, especially as it doesn't assume any background knowledge of algebraic geometry.
It might be a good book for a mathematic student but not a good one for an engineering student........2005-09-06
It might be a good book for a mathematic student but not a good one for an engineering student. There are too many mathematic jargons with very limited explanations. Many notations just take for granted that the readers have already known them. It is very hard for people who have limited math background. Moreover, there are so many editorial errors in the current version. I would suggest that the author put a mathematical symbol/sign index at the end of the book and make it easier for the readers to look for their meanings.
Excellent.......2003-07-19
Anyone who writes a book on elliptic curves will never do a bad job, for these objects are so beautiful that it would be a sacrilege to do otherwise. Those who study elliptic curves fall under their spell, not only because of their beauty, but also because of their many applications: the spinning top in mechanics, cryptography, exactly solved models in statistical mechanics, precession of the Mercury perihelion in general relativity, the proof of Fermat's Last (Wiles) Theorem, control theory, and string theory, to name a few. This book is an excellent treatment of ECs and would be good for a graduate student starting out in the field. The author gives many concrete examples of the main theorems, and helpful exercises are found at the end of each chapter.
The author begins the book with two neat problems that motivate well the subject of elliptic curves: the pyramid of cannonballs and the right triangle problem, i.e. which integers can occur as areas of right triangles with integer sides? He then immediately begins the elementary theory of ECs in chapter 2. The treatment is pretty standard, although he proves Pascal's and Pappus's theorems using the associativity of the group operation on ECs, which is not usually done in books on ECs. Also somewhat non-standard this early in the game is the discussion of reduction of ECs modulo various primes, and the subsequent definitions of additive, split multiplicative, and non-split multiplicative reduction.
The study of torsion points is done in chapter 3 with the Weil pairing on the n-torsion of an EC taking center stage. A fairly short chapter, the author delays the proof of the properties of the Weil pairing until chapter 11, where it is done with divisors.
Chapter 4 deals with elliptic curves over finite fields, and is one of the most important in the book from the standpoint of cryptographic applications of ECs. Hasse's theorem, giving the bounds for the group of points on an EC over a finite field, is proven in detail. The Frobenius endomorphism is introduced, and a proof of Schoof's algorithm for computing the number of points on ECs over a finite field is given a detailed treatment. There are many symbolic computational software packages in both the open and commerical realm which will do the counting straightforwardly, and anyone interested in cryptography will need to be familiar with some of these. Supersingular curves in characteristic p are introduced, and the author gives a good discussion of the reason why they are named as such.
The discrete logarithm problem, a topic also very important for cryptographic applications, is discussed in chapter 5. The chapter beings with the index calculus, and, recognizing that it does not apply to general groups, the Pohlig-Hellman, baby step-giant step method, and Pollards rho and lambda methods are discussed in details. The author then shows that for supersingular and "anomalous" curves, that the discrete logarithm problem can be reduced to an easier discrete logarithm problem. Along the way, two important concepts are introduced: the p-adic valuation, and the Tate-Lichtenbaum pairing, the latter of which is related to the Weil pairing, but applies to situations where the Weil pairing does not.
Elliptic curve cryptography is then discussed in chapter 6, and the treatment is fairly thorough. The author shows to what extent the Decision Diffie-Hellman problem can be solved using the Weil pairing. He also shows how to represent a message on an elliptic curve, satisfying early on any reader's curiosity on just how this is done. The El Gamal and ECDSA are compared in terms of their computational efficiency. An EC generalization of RSA is also discussed in some detail, along with a cryptosystem based on the Weil pairing. Chapter 7 then gives other applications of ECs, such as factoring and primality testing.
Chapter 8 marks the beginning of the "heavy artillery" in the theory of ECs, for here the author begins the discussion of elliptic curves over the rational numbers, which can be viewed as an example of Diophantine geometry. The famous Mordell-Weil theorem is proved, and as a sign that one is definitely in the arena of modern mathematics, the proof is given in terms of Galois cohomology, which is an abstraction of the Fermat method of descent. The reader gets a taste of height functions, and via some good examples, gets insight into why the rank of the EC is so difficult to compute. A neat example is given of a nontrivial Shafarevich-Tate group.
I did not read the chapters 9, 10, or 11 on ECs over the complex numbers, complex multiplication, and divisors, so I will omit their review. Chapter 12 introduces the famous zeta functions, and their use in obtaining arithmetic information about an EC. Zeta functions motivate the definition of an L-function of an EC, these being tremendously important in modern developments in the theory of ECs, such as the Swinnerton-Dyer and Birch conjecture, the latter of which is motivated rather nicely in this chapter.
The last chapter of the book is an excellent introduction to the proof of Fermat's Last Theorem. Considering the level of the book, the author captures very well the essential ideas. Readers will be well prepared, after studying more algebraic number theory and the theory of Galois representations (which the author only skims in the book), to tackle the full proof if so desired.
Book Description
Since the appearance of the authors’ first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics. They are divided into the areas of protocols, implementation techniques, mathematical foundations and pairing based cryptography. Each of the topics is presented in an accessible, coherent and consistent manner for a wide audience that will include mathematicians, computer scientists and engineers.
Download Description
Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics. They are divided into the areas of protocols, implementation techniques, mathematical foundations and pairing based cryptography. Each of the topics is presented in an accessible, coherent and consistent manner for a wide audience that will include mathematicians, computer scientists and engineers.
Customer Reviews:
The latest cutting edge research on Elliptic Curve Cryptography.......2005-09-26
First, the reviews dated below (July 25, 2002, July 29, 2000 [Lee Carlson] and January 31, 2000) are refering to Blake, Seroussi and Smart's first book: Elliptic Curves in Cryptography: London Mathematical Society Lecture Note Series 265, not the new book Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Note Series 317.
Contents of Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Note Series 317 (ISBN-10: 052160415X).
Chapter I: covers Elliptic Curve Based Protocols in the IEEE 1363 standard, ECDSA (EC Digital Signature Algorithm), ECDH (EC Diffie-Hellman) /ECMQV (EC MQV protocol of Law, Menezes, QU, Solinas and Vanstone) and ECIES (EC Integrated Encryption Scheme).
Chapter II: on the provable security of ECDSA.
Chapter III: proofs of security for ECIES,
Chapter IV: side-channel analysis.
Chapter V: defenses against side-analysis.
Chapter VI: advances in point counting. (This is an advanced chapter covering Takakazu Satoh's fast p-adic algorithm. Note, a very brief introduction to p-adic fields and extensions is given at the start of this chapter.)
Chapter VII: hyperelliptic curves and HCDLP.
Chapter VIII: weil descent attacks.
Chapter IX: pairings.
Chapter X: cryptography from pairings. (Highlight: covers Boneh and Franklin's identity based encryption (IBE) using Weil pairings.)
This book, published in April, 2005, brings the reader up to date with much of the latest research on Elliptic Curve Cryptography.
The algorithms are in the same format as in Elliptic Curves in Cryptography. Also, like in their first book, this book also does not always give proofs.
Highly recommended for advanced graduate students, applied mathematicians and computer scientists in the field of public key cryptography. The mathematics is more advanced than in their first book on Elliptic Curve Cryptography.
too much math.......2002-07-25
This is a fairly complete treatment of elliptic curve cryptography. It suffers from a very uneven treatment. The chapters on implementation are well written and easy to read. The material on the logarithm problem, however, is much too advanced and will only be accessible to research mathematicians. A big omission in the book are protocols such as signatures and encryption.
Good compact book on elliptic curves in cryptography.......2000-07-29
This book gives a good summary of the current algorithms and methodologies employed in elliptic curve cryptography. The book is short (less than 200 pages), so most of the mathematical proofs of the main results are omitted. The authors instead concentrate on the mathematics needed to implement elliptic curve cryptography. The book is written for the reader with some experience in cryptography and one who has some background in the theory of elliptic curves. A reader coming to the field for the first time might find the reading difficult. The authors do give a brief summary in Chapter 1 on the idea of doing cryptography based on group theory. They then move on to discuss finite field arithmetic in Chapter 2. The reader is expected to know some of the basic notions of multiprecision arithmetic for integers. The authors choose to work with 2^16. Psuedocode is given for doing modular arithmetic with Montgomery arithmetic given special attention. The last section of the chapter gives a good summary of arithmetic in fields of characteristic 2. Chapter 3 discusses very compactly arithmetic in elliptic curves. This is where the reader should already have the background in the theory of elliptic curves, since the reading is very fast and formal. The authors do a good job of summarizing how modular polynomials come into play in elliptic curve cryptography and give some explicit examples of these polynomials. The most important chapter of the book is Chapter 4, where the authors give a discussion of how to implement elliptic curves efficiently in cryptosystems. This chapter is nicely written and pseudocode appears many times with lots of nice examples. This chapter serves as background for the next one on the discrete logarithm problem using elliptic curves over finite fields. The MOV attack, the anomalous attack, and the baby step/giant step methods are discussed very nicely. Random methods, such as the tame and wild kangaroo are discussed at the end of the chapter.
The next three chapters concentrate on how to actually generate elliptic curves for cryptosystems, with particular attention payed to the Schoof Algorithm. The chapter on Schoof's algorithm is more detailed than the rest of the chapters and this makes for better reading. The authors do discuss how to generate curves using complex multiplication although the discussion is somewhat hurried. The next chapter discusses how elliptic curves have been applied to other areas in cryptography, such as factoring, etc. A good discussion of the ECPP algorithm on proving primality ends the chapter. The authors end the chapter with a discussion of hyperelliptic cryptography. Anyone familiar with the theory of elliptic curves and how they are applied to cryptography will naturually ask if hyperelliptic curves have any advantages over the elliptic case. The authors never really address this explicity but do give examples on just what is involved in implementing hyperelliptic curves in cryptography. Overall a fine addition to the literature on elliptic curves in cryptography. One would hope that the authors would write a follow-up book on hyperelliptic curves and maybe on general algebraic curves and their possible use in this area.
Good book.......2000-02-01
I think this is one of the best introductions to elliptic curve cryptosystems. This book have all the last algorithms in the field.
Book Description
This is a textbook for a course (or self-instruction) in cryptography with emphasis on algebraic methods. The first half of the book is a self-contained informal introduction to areas of algebra, number theory, and computer science that are used in cryptography. Most of the material in the second half - "hidden monomial" systems, combinatorial-algebraic systems, and hyperelliptic systems - has not previously appeared in monograph form. The appendix by Menezes, Wu, and Zuccherato gives an elementary treatment of hyperelliptic curves. This book is intended for graduate students, advanced undergraduates, and scientists working in various fields of data security.
Customer Reviews:
Excellent, but only if you have extensive knowledge of math.......2004-06-28
The textbook is intended for students with extensive knowledge of number theory, field theory, and algebraic techniques. It is terse and runs through the material using the definition-lemma-proof-theorem-proof method, with almost no examples. For students without the aforementioned prerequisites, the book is almost impossible to understand.
The book can be great for students with the mathematical prerequisites and with sufficient mathematical maturity to understand elaborate definitions, theorems and proofs and who want to learn the material efficiently and quickly.
The beginning student is advised to look for other, more elementary textbooks.
The book contains many exercises with solutions at the end of the book.
Excelent.......2000-05-25
It's a very good book about cryptography and all the "stuff" about it. Neal Koblick is one of the invertor on ECC, so he knows about he talks.
Average customer rating:
|
Algorithmic Number Theory: 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings (Lecture Notes in Computer Science)
Manufacturer: Springer
ProductGroup: Book
Binding: Paperback
 Encryption
| Security & Encryption
| Web Development
| Computers & Internet
| Subjects
| Books
Cryptography
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
General
| Science
| Subjects
| Books
Discrete Mathematics
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Discrete Mathematics
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Professional
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Science
| Qualifying Textbooks - Fall 2007
| Stores
| Books
ASIN: 3540676953 |
Book Description
This book constitutes the refereed proceedings of the 4th International Algorithmic Number Theory Symposium, ANTS-IV, held in Leiden, The Netherlands, in July 2000.The book presents 36 contributed papers which have gone through a thorough round of reviewing, selection and revision. Also included are 4 invited survey papers. Among the topics addressed are gcd algorithms, primality, factoring, sieve methods, cryptography, linear algebra, lattices, algebraic number fields, class groups and fields, elliptic curves, polynomials, function fields, and power sums.
Average customer rating:
|
Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings (Lecture Notes in Computer Science)
Manufacturer: Springer
ProductGroup: Book
Binding: Paperback
Cryptography
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Programming
| Computers & Internet
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
General
| Software
| Computers & Internet
| Subjects
| Books
General
| Science
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Medicine
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Medicine
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Professional
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Science
| Qualifying Textbooks - Fall 2007
| Stores
| Books
ASIN: 3540438637 |
Book Description
This book constitutes the refereed proceedings of the 5th International Algorithmic Number Theory Symposium, ANTS-V, held in Sydney, Australia, in July 2002.The 34 revised full papers presented together with 5 invited papers have gone through a thorough round of reviewing, selection and revision. The papers are organized in topical sections on number theory, arithmetic geometry, elliptic curves and CM, point counting, cryptography, function fields, discrete logarithms and factoring, Groebner bases, and complexity.
Book Description
This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, Germany in July 2006.
The 37 revised full papers presented together with 4 invited papers were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.
Average customer rating:
|
Elliptic Curves: Theory and Cryptography, Second Edition (Discrete Mathematics and Its Applications)
Lawrence C. Washington
Manufacturer: Chapman & Hall/CRC
ProductGroup: Book
Binding: Hardcover
General
| Science
| Subjects
| Books
Combinatorics
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Combinatorics
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
ASIN: 1420071467 |
Book Description
This book constitutes the refereed proceedings of the 7th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2004, held in Singapore in March 2004.
The 32 revised full papers presented were carefully reviewed and selected from 106 submissions. All current issues in public key cryptography are addressed ranging from theoretical and mathematical foundations to a broad variety of public key cryptosystems.
Books:
- Encyclopedia Prehistorica: Sharks and Other Sea Monsters
- Essential Cell Biology, Second Edition
- Finite Math with Applications (9th Edition)
- Finite Mathematics and Calculus with Applications (7th Edition) (Lial/Greenwell/Ritchey Series)
- Finite Mathematics and Its Applications
- Finite Mathematics for the Managerial, Life, and Social Sciences (with CD-ROM and Printed Access Card iLrn Tutorial, vMentor 1-Semester)
- Flow Measurement Engineering Handbook
- Food of the Gods: The Search for the Original Tree of Knowledge A Radical History of Plants, Drugs, and Human Evolution
- Foundations of Image Science
- From So Simple a Beginning: Darwin's Four Great Books (Voyage of the Beagle, The Origin of Species, The Descent of Man, The Expression of Emotions in Man and Animals)
Books Index
Books Home
Recommended Books
- Generation to Generation: Family Process in Church and Synagogue
- Between God and Man
- When Strange Gods Call
- Thomas Jefferson: Author of America
- They Call Me Naughty Lola: Personal Ads from the London Review of Books
- Applications = Code + Markup: A Guide to the Microsoft Windows Presentation Foundation
- A Feast for Crows
- Louis Xiv And The Greatness Of France
- Tolley's Trading in the European Union - a Guide to Business and Taxation
- To Princess From Krug
Guide to Elliptic Curve Cryptography (Springer Professional Computing)
Rational Points on Elliptic Curves (Undergraduate Texts in Mathematics)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Handbook of Elliptic and Hyperelliptic Curve Cryptography (Discrete Mathematics and Its Applications)
The Arithmetic of Elliptic Curves (Graduate Texts in Mathematics)
