Sciweavers

45 search results - page 4 / 9
» Algebraic Attacks on Combiners with Memory and Several Outpu...
Sort
View
IANDC
2008
150views more  IANDC 2008»
13 years 7 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
IACR
2011
177views more  IACR 2011»
12 years 7 months ago
New attacks on Keccak-224 and Keccak-256
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...
Itai Dinur, Orr Dunkelman, Adi Shamir
ACL
1998
13 years 8 months ago
Improving Data Driven Wordclass Tagging by System Combination
In this paper we examine how the differences in modelling between different data driven systems performing the same NLP task can be exploited to yield a higher accuracy than the b...
Hans van Halteren, Jakub Zavrel, Walter Daelemans
CHES
2000
Springer
121views Cryptology» more  CHES 2000»
13 years 11 months ago
On Boolean and Arithmetic Masking against Differential Power Analysis
Abstract. Since the announcement of the Differential Power Analysis (DPA) by Paul Kocher and al., several countermeasures were proposed in order to protect software implementations...
Jean-Sébastien Coron, Louis Goubin
EUROCRYPT
2006
Springer
13 years 11 months ago
How to Strengthen Pseudo-random Generators by Using Compression
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
Aline Gouget, Hervé Sibert