Sciweavers

61 search results - page 12 / 13
» Arbitrary Bit Permutations in One or Two Cycles
Sort
View
SIAMDM
2010
194views more  SIAMDM 2010»
12 years 12 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
MICRO
2008
IEEE
113views Hardware» more  MICRO 2008»
13 years 11 months ago
From SODA to scotch: The evolution of a wireless baseband processor
With the multitude of existing and upcoming wireless standards, it is becoming increasingly difficult for hardware-only baseband processing solutions to adapt to the rapidly chan...
Mark Woh, Yuan Lin, Sangwon Seo, Scott A. Mahlke, ...
IACR
2011
88views more  IACR 2011»
12 years 4 months ago
Storing Secrets on Continually Leaky Devices
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...
Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Da...
ESANN
2007
13 years 6 months ago
Order in Complex Systems of Nonlinear Oscillators: Phase Locked Subspaces
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
Jan-Hendrik Schleimer, Ricardo Vigário
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 5 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...