1085 search results - page 23 / 217 » A Timing Attack on RC5 |
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
MMMACNS
2005
Springer
14 years 27 days ago
2005
Springer
This paper describes a novel approach for preventative protection from both known and previously unknown malicious software. It does not rely on screening the code for signatures ...
JALC
2006
13 years 7 months ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
APSCC
2007
IEEE
14 years 1 months ago
2007
IEEE
FSE
2007
Springer
14 years 1 months ago
2007
Springer