Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series) [Paperback]

Ian F. Blake (Editor), Gadiel Seroussi (Editor), Nigel P. Smart (Editor)

Book Description

Publication Date: April 25, 2005 | ISBN-10: 052160415X | ISBN-13: 978-0521604154 | Edition: 2nd

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.

Editorial Reviews

Review

"This book gives a good introduction to the mathematics behind the design of elliptic-curve cryptosystems and their implementation...this work is an important addition to the literature." Computing Reviews

"This lovely book [Elliptic Curves in Cryptography] has a thorough coverage of bit-counting issues, something that matters greatly when you are thinking of implementing ECC. The text covers valuable background research...[it] is clearly written and brings the reader up to date on current research. It is a gem." Bulletin of the American Mathematical Society --This text refers to an alternate Paperback edition.

Book Description

Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. 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.

Product Details

• Paperback: 298 pages
• Publisher: Cambridge University Press; 2nd edition (April 25, 2005)
• Language: English
• ISBN-10: 052160415X
• ISBN-13: 978-0521604154
• Product Dimensions: 8.7 x 6 x 0.7 inches
• Shipping Weight: 14.9 ounces (View shipping rates and policies)
• Average Customer Review: 4.7 out of 5 stars  See all reviews (3 customer reviews)
• Amazon Best Sellers Rank: #2,470,340 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

26 of 29 people found the following review helpful:

4.0 out of 5 stars Good compact book on elliptic curves in cryptography, July 29, 2000

By 

Dr. Lee D. Carlson (Baltimore, Maryland USA) - See all my reviews
(VINE VOICE)    (HALL OF FAME REVIEWER)    (REAL NAME)   

This review is from: Elliptic Curves in Cryptography (London Mathematical Society Lecture Note Series) (Paperback)

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.

3 of 3 people found the following review helpful:

5.0 out of 5 stars The latest cutting edge research on Elliptic Curve Cryptography, September 25, 2005

By 

Stuart-Little - See all my reviews
(VINE VOICE)   

Amazon Verified Purchase

This review is from: Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series) (Paperback)

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.

7 of 20 people found the following review helpful:

5.0 out of 5 stars Good book, January 31, 2000

By A Customer

This review is from: Elliptic Curves in Cryptography (London Mathematical Society Lecture Note Series) (Paperback)

I think this is one of the best introductions to elliptic curve cryptosystems. This book have all the last algorithms in the field.