Sciweavers

1173 search results - page 92 / 235
» On the Compositionality of Round Abstraction
Sort
View
139
Voted
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
14 years 10 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
ISCC
2009
IEEE
163views Communications» more  ISCC 2009»
15 years 7 months ago
Distributed parallel scheduling algorithms for high-speed virtual output queuing switches
Abstract—This paper presents a novel scalable switching architecture for input queued switches with its proper arbitration algorithms. In contrast to traditional switching archit...
Lotfi Mhamdi, Mounir Hamdi
ASIACRYPT
2004
Springer
15 years 6 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
104
Voted
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
15 years 2 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
LATINCRYPT
2010
14 years 11 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...