Sciweavers

517 search results - page 98 / 104
» Bit Encryption Is Complete
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
AFRICACRYPT
2009
Springer
14 years 2 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 ...
LCTRTS
2009
Springer
14 years 2 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
SMA
2009
ACM
105views Solid Modeling» more  SMA 2009»
14 years 2 months ago
SOT: compact representation for tetrahedral meshes
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex reference...
Topraj Gurung, Jarek Rossignac
PIMRC
2008
IEEE
14 years 2 months ago
Joint turbo channel estimation and data recovery in fast fading mobile coded OFDM
Orthogonal frequency division multiplexing (OFDM) system suffers extra performance degradation in fast fading channel due to intercarrier interference (ICI). Combing frequency dom...
Daniel N. Liu, Michael P. Fitz