Sciweavers

729 search results - page 85 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
ANOR
2004
116views more  ANOR 2004»
13 years 10 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ASIACRYPT
2010
Springer
13 years 8 months ago
Rotational Rebound Attacks on Reduced Skein
Abstract. In this paper we combine a recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competitio...
Dmitry Khovratovich, Ivica Nikolic, Christian Rech...
OPODIS
2010
13 years 8 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
13 years 8 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
CISC
2009
Springer
174views Cryptology» more  CISC 2009»
13 years 8 months ago
Algebraic Side-Channel Attacks
Abstract. In 2002, algebraic attacks using overdefined systems of equations have been proposed as a potentially very powerful cryptanalysis technique against block ciphers. However...
Mathieu Renauld, François-Xavier Standaert