Skip to product information
1 of 1
Regular price £45.29 GBP
Regular price £27.99 GBP Sale price £45.29 GBP
Sale Sold out
Free UK Shipping

Freshly Printed - allow 8 days lead

Advances in Elliptic Curve Cryptography

This second volume addresses tremendous progress in elliptic curve cryptography since the first volume.

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

9780521604154, Cambridge University Press

Paperback, published 25 April 2005

298 pages, 7 b/w illus. 11 tables
22.9 x 15.2 x 1.7 cm, 0.44 kg

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.

Part I. Protocols: 1. Elliptic curve base protocols N. P. Smart
2. On the provable security of ECDSA D. Brown
3. Proofs of security for ECIES A. W. Dent
Part II. Implementation Techniques: 4. Side channel analysis E. Oswald
5. Defenses against side-channel analysis M. Joye
Part III. Mathematical Foundations: 6. Advances in point counting F. Vercauteren
7. Hyperelliptic curves and the HCDLP P. Guadry
8. Weil descent attacks F. Hess
Part IV. Pairing Based Techniques: 9. Pairings S. Galbraith
10. Cryptography from pairings K. G. Paterson.

Subject Areas: Electronics & communications engineering [TJ], Combinatorics & graph theory [PBV], Mathematical foundations [PBC], Coding theory & cryptology [GPJ]

View full details