1173 search results - page 134 / 235 » On the Compositionality of Round Abstraction |
106
click to vote
ANOR
2004
15 years 16 days ago
2004
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...
89
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
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...
110
click to vote
OPODIS
2010
14 years 10 months ago
2010
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 ...
128
click to vote
APPROX
2009
Springer
14 years 10 months ago
2009
Springer
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....
114
click to vote
CISC
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. In 2002, algebraic attacks using overdefined systems of equations have been proposed as a potentially very powerful cryptanalysis technique against block ciphers. However...