Background Elliptic curve cryptographic schemes were proposed independently in 1985 by
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …

The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

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

This paper explains the design and implementation of a high-security elliptic-curve-Diffie-
Hellman function achieving record-setting speeds: eg, 832457 Pentium III cycles (with …

We present a general technique for the efficient computation of pairings on Jacobians of
supersingular curves. This formulation, which we call the eta pairing, generalizes results of …

Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric
cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off …

Настоящая книга посвящена перспективному направлению в области защиты
информации, математическую основу которого составляет теория эллиптических …

In this paper, we propose a efficient and secure point multiplication algorithm, based on
double-base chains. This is achieved by taking advantage of the sparseness and the ternary …

This paper sets new software speed records for high-security Diffie-Hellman computations,
specifically 251-bit elliptic-curve variable-base-point scalar multiplication. In one second of …

This papers introduces several binary scalar multiplication algorithms with applications to
cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when …