Advances In Elliptic Curve Cryptography

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.

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.

TABLE OF CONTENT:
Chapter 01 - Elliptic Curve Based Protocols
Chapter 02 - On the Provable Security of ECDSA
Chapter 03 - Proofs of Security for ECIES
Chapter 04 - Side-Channel Analysis
Chapter 05 - Defences Against Side-Channel Analysis
Chapter 06 - Advances in Point Counting
Chapter 07 - Hyperelliptic Curves and the HCDLP
Chapter 08 - Weil Descent Attacks
Chapter 09 - Pairings
Chapter 10 - Cryptography from Pairings

Download here

Password:ganelon