Review4 Handbook of Elliptic and Hyperelliptic Curve Cryptography Editors: H. Cohen and G. Frey Publisher: Chapman & Hall/CRC, 2006, Hardcover ISBN 1-58488-518-1 Price: $99.95 (US) Reviewed by: Lawrence C. Washington University of Maryland, College Park, MD. Overview Elliptic curve cryptography was introduced in the mid 1980s and is now nding applicability in many public key situations. In particular, it provides a level of security comparable to that of classical methods while employing smaller numbers, which results in signi cant advantages in systems with limited computing resources such as smart cards. Most cryptographic applications depend on the di culty of solving the discrete logarithm problem. In the classical situations, there is a large prime p and numbers a and b are given such that ax â¡ b (mod p) for some x. The problem is to nd x. The elliptic curve analogue starts with an elliptic curve E de ned over a nite eld and points A and B on E. There is a law of addition for points on E, so that if x is an integer (assume it is positive, for simplicity), then we can repeatedly add A to itself (A + A + + A with
/lp/association-for-computing-machinery/review-of-handbook-of-elliptic-and-hyperelliptic-curve-cryptography-by-NHwHZtkQy1