578 search results - page 54 / 116 » Making PRIME usable |
IEEEIAS
2009
IEEE
13 years 5 months ago
2009
IEEE
In order to avoid security threats caused by password attack and replay attack in single sign-on protocal, the most methods on sovling these issues are making use of complicated te...
SC
2009
ACM
14 years 2 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
We present a statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs. Earlier statistical algorithms that focus solely on identifying p...
IPTPS
2005
Springer
14 years 1 months ago
2005
Springer
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
PKC
2005
Springer
14 years 1 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...