Sciweavers

105 search results - page 17 / 21
» Efficient elliptic curve exponentiation
Sort
View
CIS
2006
Springer
13 years 11 months ago
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto
JCP
2007
214views more  JCP 2007»
13 years 7 months ago
Reconstruction of 3D Human Facial Images Using Partial Differential Equations
—One of the challenging problems in geometric modeling and computer graphics is the construction of realistic human facial geometry. Such geometry are essential for a wide range ...
Eyad Elyan, Hassan Ugail
IJNSEC
2008
126views more  IJNSEC 2008»
13 years 7 months ago
A Hybrid Group Key Management Protocol for Reliable and Authenticated Rekeying
We present a hybrid group key management protocol that incorporates both a centralized and a contributory scheme for key management, and a tree-based Elliptic Curve Diffie-Hellman...
Depeng Li, Srinivas Sampalli
DCC
2010
IEEE
13 years 7 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
14 years 1 months ago
Predicting Secret Keys Via Branch Prediction
This paper announces a new software side-channel attack — enabled by the branch prediction capability common to all modern highperformance CPUs. The penalty paid (extra clock cyc...
Onur Aciiçmez, Çetin Kaya Koç...