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.
- Provides an up-to-date treatment of critical topics in cryptography
- The chapters are written by the leading international experts in each area
- The topics are made accessible for the first time outside of research journals
Read more
Customer reviews

Not yet reviewed
Be the first to review

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: April 2005
- format: Paperback
- isbn: 9780521604154
- length: 298 pages
- dimensions: 229 x 152 x 17 mm
- weight: 0.44kg
- contains: 7 b/w illus. 11 tables
- availability: Available
Table of Contents
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.
Look Inside

General Resources

Resources

Find resources associated with this title

Back to resources home

Type	Name	Unlocked *	Format	Size

Showing of

This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

If you are having problems accessing these resources please contact [email protected].

Editors
Ian F. Blake, University of British Columbia, Vancouver
Gadiel Seroussi, Hewlett-Packard Laboratories, Palo Alto, California
Nigel P. Smart, University of Bristol
Contributors
N. P. Smart, D. Brown, A. W. Dent, E. Oswald, M. Joye, F. Vercauteren, P. Gaudry, F. Hess, S. Galbraith, K. G. Paterson