Overview
- How are reviewers describing this item?
elliptic, finite, proof, level and good. - Our engine has profiled the reviewer patterns and has determined that there is minimal deception involved.
- Our engine has determined that the review content quality is high and informative.
- Our engine has discovered that over 90% high quality reviews are present.
- This product had a total of 13 reviews as of our last analysis date on Feb 20 2020.
Helpful InsightsBETA
Posted by a reviewer on Amazon
Most of the textbooks i review are a mess and seem to exist solely to egrandize the author and subidize a professors lifestyle
Posted by a reviewer on Amazon
The field of cryptography is vast of course and a book of this size could not capture it effectively
Posted by a reviewer on Amazon
In discussing the arithmetic of elliptic curves over finite fields the authors give a good motivation for hasses 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
Posted by a reviewer on Amazon
This reviewer has not studied hasses 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
Posted by a reviewer on Amazon
The algorithms therefore are not really better than black box algorithms