19 search results - page 3 / 4 » On the Efficient Generation of Prime-Order Elliptic Curves |
IJISEC
2008
13 years 6 months ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
IEICET
2008
13 years 6 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
CHES
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
IJNSEC
2010
13 years 1 months ago
2010
In 2004, a multi-signature scheme (MSS) based on the elliptic curve cryptosystem is given by Chen et al. [1]. Later, Liu and Liu [6] showed that if one of the users always sends h...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
In this paper, we present a novel approach to vectorize elliptic arcs for 3D pie chart recognition and data extraction. As a preprocessing step, a set of straight line segments ar...