1450 search results - page 227 / 290 » On the Complexity of Hardness Amplification |
AFRICACRYPT
2009
Springer
14 years 4 months ago
2009
Springer
We present the first simple power analysis (SPA) of software implementations of KeeLoq. Our attack drastically reduces the efforts required for a complete break of remote keyless...
CCS
2009
ACM
14 years 4 months ago
2009
ACM
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
IPSN
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
In many scientific applications, significant time is spent tuning codes for a particular highperformance architecture. Tuning approaches range from the relatively nonintrusive (...