Sciweavers

583 search results - page 3 / 117
» On the Complexity of Matsui's Attack
Sort
View
CRYPTO
2004
Springer
112views Cryptology» more  CRYPTO 2004»
13 years 12 months ago
Feistel Schemes and Bi-linear Cryptanalysis
Abstract. In this paper we introduce the method of bi-linear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased character...
Nicolas Courtois
ACSAC
2005
IEEE
14 years 6 days ago
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
Steven Noel, Sushil Jajodia
ASIACRYPT
1998
Springer
13 years 10 months ago
Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers
Rijmen and Preneel recently proposed for the rst time a family of trapdoor block ciphers 8]. In this family of ciphers, a trapdoor is hidden in S-boxes and is claimed to be undetec...
Hongjun Wu, Feng Bao, Robert H. Deng, Qin-Zhong Ye
EUROCRYPT
2009
Springer
14 years 7 months ago
Cryptanalysis of MDC-2
We provide a collision attack and preimage attacks on the MDC-2 construction, which is a method (dating back to 1988) of turning an n-bit block cipher into a 2n-bit hash function. ...
Christian Rechberger, Florian Mendel, Lars R. Knud...
VIZSEC
2004
Springer
13 years 12 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia