In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems. Elliptic curves offer major advances on older systems such as increased speed, less memory and smaller key sizes. As digital signatures become more and more important in the commercial world the use of elliptic curve-based signatures will become all pervasive. This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems. Due to the advanced nature of the mathematics there is a high barrier to entry for individuals and companies to this technology. Hence this book will be invaluable not only to mathematicians wanting to see how pure mathematics can be applied but also to engineers and computer scientists wishing (or needing) to actually implement such systems.
- Indispensable for researchers in this area
- Authors are top names
- Covers state of the art results
Read more
Reviews & endorsements
'… gives a comprehensive explanation of elliptic curve cryptography. It is clearly written and is appropriate for both computer scientists and mathematicians interested in the field.' E. Schaefer, Niew Archief voor Wiskunde
'… a very well written description of the use of elliptic curves in public key cryptography.' Franck Leprévost, Zentralblatt für Mathematik
'An excellent new book on elliptic curve theory and practical implementation.' Dr Dobb's Journal Online
'… 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.' Jonathan Golan, Computing Reviews
'… written in a very readable form and thus can be consulted and used both by mathematicians and by anybody wishing to learn more about the mathematics behind the implementations of elliptic curve cryptosystems.' European Maths Society Journal
See more reviews
Customer reviews

17th Oct 2024 by UName-185766
Elliptic Curve has become a defacto for crypto world and I think this book is ideal for anyone seeking complete info about it.

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: July 1999
- format: Paperback
- isbn: 9780521653749
- length: 224 pages
- dimensions: 229 x 153 x 15 mm
- weight: 0.326kg
- availability: Available
Table of Contents
Preface
1. Introduction
2. Finite field arithmetic
3. Arithmetic on an elliptic curve
4. Efficient implementation of elliptic curves
5. The elliptic curve discrete logarithm problem
6. Determining the group order
7. Schoof's algorithm and extensions
8. Generating curves using complex multiplication
9. Other applications of elliptic curves
10. Hyperelliptic curves
Appendix A. Curve examples
Bibliography
Author index
Subject index.
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].

Authors
I. Blake, University of British Columbia, Vancouver
G. Seroussi, Hewlett-Packard Laboratories, Palo Alto, California
N. Smart, University of Bristol