Sciweavers

14190 search results - page 301 / 2838
» computer 2008
Sort
View
IEICET
2008
147views more  IEICET 2008»
15 years 6 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
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...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
IJCSA
2008
131views more  IJCSA 2008»
15 years 6 months ago
On Ubiquitous Integrated Computing
: Ubiquitous integrated computing makes possible new workflow processes and business models which can meet the challenges from the fast growing digital convergence. An integrated i...
Kari Anne Haaland Thorsen, Chunming Rong
IJNSEC
2008
145views more  IJNSEC 2008»
15 years 6 months ago
Efficient Certificateless Authentication and Key Agreement (CL-AK) for Grid Computing
Most of the current security architectures for grid systems use conventional public key infrastructure (PKI) to authenticate grid members and to secure resource allocation to thes...
Shengbao Wang, Zhenfu Cao, Haiyong Bao
JC
2008
96views more  JC 2008»
15 years 6 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...
JCB
2008
122views more  JCB 2008»
15 years 6 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz