Sciweavers

54 search results - page 3 / 11
» Backtracking Algorithmic Complexity Attacks against a NIDS
Sort
View
ESORICS
2012
Springer
11 years 11 months ago
Dismantling iClass and iClass Elite
With more than 300 million cards sold, HID iClass is one of the most popular contactless smart cards on the market. It is widely used for access control, secure login and payment s...
Flavio D. Garcia, Gerhard de Koning Gans, Roel Ver...
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 10 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
14 years 2 months ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
EUROCRYPT
1994
Springer
14 years 1 months ago
The Self-Shrinking Generator
The self-shrinking generator was introduced in 1994. It is based on the idea behind the shrinking generator and despite its simplicity it has remained remarkably resistant to effic...
Willi Meier, Othmar Staffelbach
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
14 years 1 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay