Envoyer sur votre Kindle ou un autre appareil


Essai gratuit

Découvrez gratuitement un extrait de ce titre

Envoyer sur votre Kindle ou un autre appareil

Désolé, cet article n'est pas disponible en
Image non disponible pour la
couleur :
Image non disponible

An Introduction to Mathematical Cryptography [Print Replica] [Format Kindle]

Jeffrey Hoffstein , Jill Pipher , Joseph H. Silverman

Prix éditeur - format imprimé : EUR 43,20
Prix Kindle : EUR 27,26 TTC & envoi gratuit via réseau sans fil par Amazon Whispernet
Économisez : EUR 15,94 (37%)

  • Print Replica:
    Ce livre Kindle ressemble au livre imprimé
  • ISBN-10 : 0387779930
  • ISBN-13 : 978-0387779935
  • Edition : 2008
App de lecture Kindle gratuite Tout le monde peut lire les livres Kindle, même sans un appareil Kindle, grâce à l'appli Kindle GRATUITE pour les smartphones, les tablettes et les ordinateurs.

Pour obtenir l'appli gratuite, saisissez votre adresse e-mail ou numéro de téléphone mobile.


Prix Amazon Neuf à partir de Occasion à partir de
Format Kindle EUR 27,26  
Relié EUR 55,12  
Broché EUR 43,20  
-40%, -50%, -60%, -70%... Découvrez les Soldes Amazon jusqu'au 4 août 2015 inclus. Profitez-en !

Concours | Rentrée Kindle des auteurs indés - Participez au premier concours organisé par Kindle Direct Publishing et et saisissez votre chance de devenir le nouveau coup de cœur littéraire sur Amazon !

Les clients ayant acheté cet article ont également acheté

Cette fonction d'achat continuera à charger les articles. Pour naviguer hors de ce carrousel, veuillez utiliser votre touche de raccourci d'en-tête pour naviguer vers l'en-tête précédente ou suivante.

Descriptions du produit

Présentation de l'éditeur

This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, and probability are introduced and developed as required. The book covers a variety of topics that are considered central to mathematical cryptography. This book is an ideal introduction for mathematics and computer science students to the mathematical foundations of modern cryptography. The book includes an extensive bibliography and index; supplementary materials are available online.

Détails sur le produit

En savoir plus sur les auteurs

Découvrez des livres, informez-vous sur les écrivains, lisez des blogs d'auteurs et bien plus encore.

Commentaires en ligne

Il n'y a pas encore de commentaires clients sur Amazon.fr
5 étoiles
4 étoiles
3 étoiles
2 étoiles
1 étoiles
Commentaires client les plus utiles sur Amazon.com (beta)
Amazon.com: 4.6 étoiles sur 5  10 commentaires
19 internautes sur 20 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Excellent 17 décembre 2009
Par Dr. Lee D. Carlson - Publié sur Amazon.com
Format:Relié|Achat vérifié
At least for the chapters that were studied by this reviewer, the authors of this book give an effective introduction to the mathematical theory used in cryptography at a level that can be approached by an undergraduate senior in mathematics. The field of cryptography is vast of course, and a book of this size could not capture it effectively. The topics of primary importance are represented however, and the authors do a fine job of motivating and explaining the needed concepts.
The authors give an elementary overview of elliptic curves over the complex numbers, and most importantly over finite fields whose characteristic is greater than 3. The case where the characteristic is equal to 2 is delegated to its own section. In discussing the arithmetic of elliptic curves over finite fields, the authors give a good motivation for Hasse's formula, which gives a bound for the number of points of the elliptic curve (over a finite field), but they do not go into the details of the proof. The Hasse formula is viewed in some texts as a "Riemann Hypothesis" for elliptic curves over finite fields, and was proven by Hasse in 1934. This reviewer has not studied Hasse's proof, but a contemporary proof relies on the Frobenius map and its separability, two notions that the authors do not apparently want to introduce at this level of book (however they do introduce the Frobenius map when discussing elliptic curves over F2). Separability is viewed in some texts in elliptic curves as more of a technical issue, which can be ignored at an elementary level. It arises when studying endomorphisms of elliptic curves of fields of non-zero characteristic, and involves defining rational functions. The Frobenius map is not separable, and this fact allows one to show that its degree is strictly greater than the number of points in its kernel. Taking the nth power of the Frobenius map and adding to it the endomorphism which simply multiplies elements by -1, one can show that the number of points of the elliptic curve is equal to the degree of this endomorphism. Just a few more arithmetical calculations establishes Hasse's estimate.
Some more of the highlights of this part of the book:
- The reminder that the fastest known algorithm to solve the elliptic curve discrete logarithm problem takes p^1/2 steps for a finite field Fp (i.e. the algorithms therefore are not really better than "black box" algorithms).
- The brief historical discussion on public key cryptography.
- The motivational discussion for the Lenstra algorithm using simple calculations that leads to a failed attempt to find the reciprocal of an integer modulo p. This failure is used to explain the workings of the Lenstra elliptic curve factorization algorithm in a way that it is better appreciated by the reader.
- The discussion on the Frobenius map in the context of elliptic curves over F2 and its use in finding the number of points of an elliptic curve over a finite field.
- The motivational discussion for the use of distortion maps, due to the degeneracy of the Weil pairing. The distortion maps are used to define a modified Weyl pairing, which is proved to be non-degenerate.
Some omissions:
- Algorithms used to calculate the number of points of an elliptic curve over a finite field that are more efficient than brute-force counting or estimation using Hasse's formula.
- The proof that the torsion points of order m can be written as the product of two cyclic groups of order m. The authors apparently do not want to get into the notions of unramified and separable "isogenies" between elliptic curves and Galois extensions, both of which are used in the proof that they reference. Isogenies are mentioned in a footnote to the discussion on distortion maps, since the latter are isogenies.
- The proof verifying certain properties of divisors, namely that they are equal if the corresponding rational functions are constant multiples of each other, and that the degree of a divisor is zero if its sum is the zero element of the elliptic curve. The proofs were no doubt omitted due to their dependence on techniques from algebraic geometry.
- Quantum cryptography. This is discussed very briefly in the last chapter, but the subject is mature enough to be presented at the undergraduate level.
- Cryptography based on non-Abelian groups. One good example would be cryptography based on the mathematical theory of knots and braids (the braid group is non-Abelian), even though this approach is in its infancy at the present time, and in almost all cases shown to be highly vulnerable to attacks. It could have been included in the last chapter or possibly as a long exercise.
- Hyperelliptic curves are discussed very briefly in the last chapter, but a full-fledged presentation could be done in the book without missing the targeted audience. Hyperelliptic curves are also mentioned after the discussion of the MOV algorithm, wherein the authors allude to the use of Weil descent to transfer the elliptic curve discrete logarithm problem to a discrete logarithm problem in a finite field F2^m when m is composite. The authors correctly don't want to elaborate on Weil descent in any more detail, since it requires a solid knowledge of field extensions and theory of algebraic varieties at a level that one obtains in a graduate course in algebraic geometry. Suffice it to say that the strategy of Weil descent involves finding a cover of the elliptic curve by a hyperelliptic curve that is defined over the extension of the ground field. This approach has been shown to be problematic for Koblitz curves, the latter of which are discussed in the book.

Note: This review is based on a reading of chapters 5 and 8 of the book.
6 internautes sur 6 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 PERFECT 15 mars 2014
Par Stephen - Publié sur Amazon.com
Format:Relié|Achat vérifié
I'm doing my honor's thesis on theoretical Cryptography as an undergrad at Colby College, and this book has been the perfect resource. It is so clear, and many time teaches by using easy to understand concrete examples. This book is the perfect place to start if you want to learn about Crypto.
12 internautes sur 15 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Concepts explained well and plenty of examples to cement them 27 décembre 2009
Par Harry Mickalide - Publié sur Amazon.com
This is a fantastic book. The writing is simple and clear. Even if I skipped class for a week, I could sit down and read this book, confident I would receive an explanation that was both complete and easy-to-follow. I couldn't recommend it more. Even though we didn't cover elliptic curves in my class, I read the chapter anyway and found that I was able to understand anything in the chapter that I committed to learning.
2 internautes sur 2 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 Essential book 14 février 2014
Par LUIS J DOMINGUEZ PEREZ - Publié sur Amazon.com
Format:Relié|Achat vérifié
It is for undergrads, but useful at grad level to any student who didn't take the courses as an undergrad (i.e., fresh grad students discovering their love to cryptography)
4.0 étoiles sur 5 but the book is pretty good in general 7 juin 2015
Par Tolga Soyata - Publié sur Amazon.com
Format:Broché|Achat vérifié
Examples are Ok, but the book is pretty good in general. I wish the examples were a little more intuitive.
Ces commentaires ont-ils été utiles ?   Dites-le-nous

Discussions entre clients

Le forum concernant ce produit
Discussion Réponses Message le plus récent
Pas de discussions pour l'instant

Posez des questions, partagez votre opinion, gagnez en compréhension
Démarrer une nouvelle discussion
Première publication:
Aller s'identifier

Rechercher parmi les discussions des clients
Rechercher dans toutes les discussions Amazon

Rechercher des articles similaires par rubrique