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 …

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

For the last decade, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in
the industry and the academic community and has been the subject of several standards …

In this paper the benefits of implementation of the Tate pairing computation on dedicated
hardware are discussed. The main observation lies in the fact that arithmetic architectures in …

Although identity-based cryptography offers a number of functional advantages over
conventional public key methods, the computational costs are significantly greater. The …

The main topic of this paper is low‐cost public key cryptography in wireless sensor nodes.
Security in embedded systems, for example, in sensor nodes based on field programmable …

The paper presents a survey of most common hardware architectures for finite field
arithmetic especially suitable for cryptographic applications. We discuss architectures for …

COMPLEXITY OF COMPUTATION IN FINITE FIELDS SB Gashkov and IS Sergeev UDC
512.624 Page 1 Journal of Mathematical Sciences, Vol. 191, No. 5, June, 2013 COMPLEXITY …

In this paper, we propose a modified eta T pairing algorithm in characteristic three which
does not need any cube root extraction. We also discuss its implementation on a low cost …

Although identity based cryptography offers many functional advantages over conventional
public key alternatives, the computational costs are significantly greater. The core …