Sciweavers

105 search results - page 5 / 21
» Efficient elliptic curve exponentiation
Sort
View
TIT
2010
160views Education» more  TIT 2010»
13 years 2 months ago
Parameterized splitting systems for the discrete logarithm
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
Sungwook Kim, Jung Hee Cheon
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
13 years 12 months ago
Algorithms for Multi-exponentiation
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
Bodo Möller
JOC
2010
96views more  JOC 2010»
13 years 2 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
AMC
2005
188views more  AMC 2005»
13 years 7 months ago
An efficient signcryption scheme with forward secrecy based on elliptic curve
An efficient signcryption scheme based on elliptic curve is proposed in this paper. The signcryption scheme combines digital signature and encryption functions. The proposed schem...
Ren-Junn Hwang, Chih-Hua Lai, Feng-Fu Su