Sciweavers

1173 search results - page 12 / 235
» On the Compositionality of Round Abstraction
Sort
View
ADAEUROPE
2003
Springer
14 years 3 months ago
A Round Robin Scheduling Policy for Ada
Abstract. Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo Within Priorities is guaranteed to be supported by all implementations of ...
Alan Burns, Michael González Harbour, Andy ...
CISC
2007
Springer
125views Cryptology» more  CISC 2007»
14 years 4 months ago
Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
Baudoin Collard, François-Xavier Standaert,...
FSE
2010
Springer
132views Cryptology» more  FSE 2010»
14 years 2 months ago
Rebound Attack on Reduced-Round Versions of JH
Abstract. JH, designed by Wu, is one of the 14 second round candidates in the NIST Hash Competition. This paper presents the first analysis results of JH by using rebound attack. ...
Vincent Rijmen, Deniz Toz, Kerem Varici
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen
ICISC
2008
146views Cryptology» more  ICISC 2008»
13 years 11 months ago
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
Joo Yeon Cho, Miia Hermelin, Kaisa Nyberg