Sciweavers

3898 search results - page 40 / 780
» On the Bit Extraction Problem
Sort
View
PR
2008
178views more  PR 2008»
14 years 8 months ago
An effective and fast iris recognition system based on a combined multiscale feature extraction technique
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
Makram Nabti, Ahmed Bouridane
AFRICACRYPT
2009
Springer
15 years 4 months ago
Breaking KeeLoq in a Flash: On Extracting Keys at Lightning Speed
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...
Markus Kasper, Timo Kasper, Amir Moradi, Christof ...
RAID
1999
Springer
15 years 2 months ago
Towards trapping wily intruders in the large
The rapid increase in network bandwidth from mega bits per second to giga bits per second and potentially to tera bits per second, is making it increasingly difficult to carry out...
Glenn Mansfield
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 1 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
FOCS
2005
IEEE
15 years 3 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks