Elliptic curves in cryptography
Elliptic curves in cryptography By Ian F Blake; G Seroussi; Nigel P Smart (eds.)
1999 | 218 Pages | ISBN: 0521653746 | DJVU | 2 MB
1999 | 218 Pages | ISBN: 0521653746 | DJVU | 2 MB
Elliptic curve cryptography is a major challenger to the dominant RSA/DSA systems, with increased speed, less memory required and smaller key sizes. This book summarises knowledge built up within Hewlett Packard over a number of years. 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