729 search results - page 37 / 146 » And Or Hierarchies and Round Abstraction |
FSE
2007
Springer
14 years 1 months ago
2007
Springer
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 ...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
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...
EUROCRYPT
2001
Springer
14 years 5 days ago
2001
Springer
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...
INFOCOM
2000
IEEE
14 years 2 days ago
2000
IEEE
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...
FSE
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...