# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Guide to elliptic curve cryptography. (English) Zbl 1059.94016
Springer Professional Computing. New York, NY: Springer (ISBN 0-387-95273-X/hbk). xx, 311 p. EUR 64.95/net; sFr. 115.00; £ 50.00; \$ 59.95 (2004).

The growing field of elliptic curve cryptography (ECC) has seen the publishing in the last years of several books with the common feature of gathering together mathematical materials related to the arithmetic and geometry of elliptic curves, in particular those defined over a finite ground field, together with its applications to public key cryptography. The weight of each one of these two ingredients varies in function of the objectives of each book and its foreseen reader’s typology.

The present book does not seek to put the emphasis in the mathematical aspects of the theory of elliptic curves. In the authors’ words: “the presentation is targeted to a diverse audience, and generally assumes no more than an undergraduate degree in computer science, engineering or mathematics.”

Accordingly topics such as the point counting algorithms: SEA (Schoof, Elkies and Atkins), Satoh, etc. are only mentioned (in the Preface the authors say that “presenting these topics in a readable and concise form is a formidable challenge postponed for another day”). Neither does the book approach the analysis of the specific attacks to the elliptic curve discrete logarithm problem such as the MOV (Menezes, Okamoto and Vanstone) attack, the Frey and Ruck attack or the Weil descent attack. The interested reader can find such materials in other books with a similar title, for example “Elliptic Curves in Cryptography” by I. F. Blake, G. Seroussi and N. P. Smart [Vol I (London Mathematical Society Lecture Note Series 265, Cambridge U. Press) (1999; Zbl 0937.94008); and Vol II (Cambridge U. Press) (2005)].

Instead the present book puts the emphasis in the practical side of the field to be a summary of the implementations on security aspects for ECC. Particular attention is paid to the existent industry and government ECC standards (ANSI, IEEE, and ISO/IEC) and to the algorithmic aspects of the treated topics (throughout the text, there are more than a hundred algorithms).

After an introductory chapter the book focuses on the study of efficient methods to perform the arithmetic in a finite field ${𝔽}_{q}$ (Chapter 2) and the arithmetic on an elliptic curve defined over ${𝔽}_{q}$ (Chapter 3). Chapter 4 studies some selected protocols for digital signature, public key encryption and key establishment. Finally Chapter 5 deals with some issues in software and hardware implementation as well as a paragraph that studies the side channel attacks and their countermeasures.

A paragraph of Notes at the end of each chapter provide to the reader complementary information and pertinent references (the Bibliography of the book has 489 items).

##### MSC:
 94A60 Cryptography 94-01 Textbooks (information and communication) 11T71 Algebraic coding theory; cryptography 14G50 Applications of algebraic geometry to coding theory and cryptography