54 search results - page 6 / 11 » Backtracking Algorithmic Complexity Attacks against a NIDS |
CISC
2007
Springer
14 years 1 months ago
2007
Springer
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...
DAC
2007
ACM
13 years 11 months ago
2007
ACM
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
ESORICS
2004
Springer
14 years 1 months ago
2004
Springer
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
LATINCRYPT
2010
13 years 6 months ago
2010
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 ...