Sciweavers

400 search results - page 5 / 80
» Derandomization and Distinguishing Complexity
Sort
View
FCT
2003
Springer
15 years 2 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
MYCRYPT
2005
Springer
187views Cryptology» more  MYCRYPT 2005»
15 years 3 months ago
Distinguishing Attacks on T-Functions
Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function an...
Simon Künzli 0002, Pascal Junod, Willi Meier
EUROCRYPT
2011
Springer
14 years 1 months ago
Statistical Attack on RC4 - Distinguishing WPA
Abstract. In this paper we construct several tools for manipulating pools of biases in the analysis of RC4. Then, we show that optimized strategies can break WEP based on 4000 pack...
Pouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux
JCT
2010
66views more  JCT 2010»
14 years 4 months ago
On fixed point sets of distinguished collections for groups of parabolic characteristic
We determine the nature of the fixed point sets of groups of order p, acting on complexes of distinguished p-subgroups (those p-subgroups containing pcentral elements in their cent...
John Maginnis, Silvia Onofrei
103
Voted
FSE
2005
Springer
117views Cryptology» more  FSE 2005»
15 years 3 months ago
A New Distinguisher for Clock Controlled Stream Ciphers
In this paper we present a distinguisher targeting towards irregularly clocked filter generators. The attack is applied on the irregularly clocked stream cipher called LILI-II. LI...
Håkan Englund, Thomas Johansson