Sciweavers

1173 search results - page 39 / 235
» On the Compositionality of Round Abstraction
Sort
View
ICMT
2010
Springer
14 years 2 months ago
Surviving the Heterogeneity Jungle with Composite Mapping Operators
Abstract. Model transformations play a key role in the vision of Modelngineering. Nevertheless, mechanisms like abstraction, variation and composition for specifying and applying r...
Manuel Wimmer, Gerti Kappel, Angelika Kusel, Werne...
FSE
2007
Springer
103views Cryptology» more  FSE 2007»
14 years 4 months ago
Improved Slide Attacks
Abstract. The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on ...
Eli Biham, Orr Dunkelman, Nathan Keller
PDCAT
2005
Springer
14 years 3 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song
EUROCRYPT
2001
Springer
14 years 2 months ago
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
Liam Keliher, Henk Meijer, Stafford E. Tavares
INFOCOM
2000
IEEE
14 years 2 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...