Sciweavers

12 search results - page 1 / 3
» Generating More MNT Elliptic Curves
Sort
View
DCC
2006
IEEE
14 years 4 months ago
Generating More MNT Elliptic Curves
In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curve...
Michael Scott, Paulo S. L. M. Barreto
ANTS
2008
Springer
103views Algorithms» more  ANTS 2008»
13 years 6 months ago
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
Koray Karabina, Edlyn Teske
IJNSEC
2010
98views more  IJNSEC 2010»
12 years 11 months ago
An MSS Based on the Elliptic Curve Cryptosystem
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...
Hemlal Sahu, Birendra Kumar Sharma
IJISEC
2008
108views more  IJISEC 2008»
13 years 4 months ago
A note on the Ate pairing
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...
Changan Zhao, Fangguo Zhang, Jiwu Huang
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
13 years 2 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...