Public key cryptography is a major interdisciplinary subject with many real-world
applications, such as digital signatures. A strong background in the mathematics underlying …

Elliptic curves have been intensively studied in algebraic geometry and number theory. In
recent years they have been used in devising efficient algorithms for factoring integers and …

Since their invention in the late seventies, public key cryptosystems have become an
indispensable asset in establishing private and secure electronic communication, and this …

Whether you're new to the field or looking to broaden your knowledge of contemporary
cryptography, this newly revised edition of an Artech House classic puts all aspects of this …

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …

We show that the elliptic curve cryptosystems based on the Montgomery-form EM: BY 2= X
3+ AX 2+ X are immune to the timing-attacks by using our technique of randomized …

Information Security was first published with McGraw Hill, then later revised and published
with Springer. This is the second edition with Springer. What has changed you might …

Elliptic curves also figured prominently in the recent proof of Fermat's Last Theorem by
Andrew Wiles. Originally pursued for purely aesthetic reasons, elliptic curves have recently …

Let-power norm. In practice the algorithm is efficient and, subject to heuristics on expected
distributions of primes, runs in expected polynomial time. This solves the underlying problem …

A Classical Introduction to Cryptography: Applications for Communications Security
introduces fundamentals of information and communication security by providing …