Results 1 - 10
of
28
Attack on broadcast RC4 revisited
- in FSE, ser. Lecture Notes in Computer Science
, 2011
"... Abstract. In this paper, contrary to the claim of Mantin and Shamir (FSE 2001), we prove that there exist biases in the initial bytes (3 to 255) of the RC4 keystream towards zero. These biases immediately provide distinguishers for RC4. Additionally, the attack on broadcast RC4 to recover the second ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
Abstract. In this paper, contrary to the claim of Mantin and Shamir (FSE 2001), we prove that there exist biases in the initial bytes (3 to 255) of the RC4 keystream towards zero. These biases immediately provide distinguishers for RC4. Additionally, the attack on broadcast RC4 to recover
A Practical Attack on Broadcast RC4
- PROC. OF FSE’01
, 2001
"... RC4 is the most widely deployed stream cipher in software applications. In this paper we describe a major statistical weakness in RC4, which makes it trivial to distinguish between short outputs of RC4 and random strings by analyzing their second bytes. This weakness can be used to mount a pract ..."
Abstract
-
Cited by 82 (1 self)
- Add to MetaCart
practical ciphertext-only attack on RC4 in some broadcast applications, in which the same plaintext is sent to multiple recipients under different keys.
Full Plaintext Recovery Attack on Broadcast RC4
- In FSE
, 2013
"... Abstract. This paper investigates the practical security of RC4 in broadcast setting where the same plaintext is encrypted with different user keys. We introduce several new biases in the initial (1st to 257th) bytes of the RC4 keystream, which are substantially stronger than known biases. Combining ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
only 234 ciphertexts. Key words: RC4, broadcast setting, plaintext recovery attack, bias, experimentally-verified attack 1
Adaptively Secure Broadcast, Revisited
"... We consider the classical problem of synchronous broadcast with dishonest majority, when a public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure against an adapt ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
an adaptive adversary who can choose which parties to corrupt as the protocol progresses. Moreover, they prove an impossibility result for adaptively secure broadcast in their setting. We argue that the communication model adopted by Hirt and Zikas is unrealistically pessimistic. We revisit the problem
A practical attack on the fixed RC4 in the wep mode
- in Adv. Cryptol. — Asiacrypt 2005, LNCS 3788
, 2005
"... Abstract. In this paper we revisit a known but ignored weakness of the RC4 keystream generator, where secret state info leaks to the generated keystream, and show that this leakage, also known as Jenkins’ correlation or the RC4 glimpse, can be used to attack RC4 in several modes. Our main result is ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract. In this paper we revisit a known but ignored weakness of the RC4 keystream generator, where secret state info leaks to the generated keystream, and show that this leakage, also known as Jenkins’ correlation or the RC4 glimpse, can be used to attack RC4 in several modes. Our main result
Routing and Broadcasting in Ad-Hoc Networks
"... I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present ..."
Abstract
- Add to MetaCart
I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present the work on various conferences, for which I thank him. I would also like to thank Prof. Dr. Roger Wattenhofer, responsible for the Koreferat of this work. Also, Prof. Dr. Oscar Nierstrasz who was willing to be the co-examinator of this work deserves many thanks. Many thanks go to my colleagues of the RVS group and of the IAM for our various interesting discussions about all kinds of topics and for making the institute a very pleasant and friendly place to work at. Special thanks go to David Steiner, Marc Steinemann, Matthias Scheidegger, Florian Baumgartner, Ruy De Oliveira, and Attila Weyland. There are many students who worked with me and helped a lot in developing and implementing. Among them I especially thankful to Thomas Bernoulli,
1On Data Complexity of Distinguishing Attacks vs. Message Recovery Attacks on Stream Ciphers
"... We revisit the different approaches used in the literature to estimate the data complexity of distinguishing attacks on stream ciphers and analyze their inter-relationships. In the process, we formally argue which approach is applicable (or not applicable) in what scenario. To our knowledge, this is ..."
Abstract
- Add to MetaCart
. This gap is not necessarily determined by a constant factor as a function of the false positive and negative rate, as one would expect. Rather this gap is also a function of the number of samples of the distinguishing attack. We perform a case study on RC4 stream cipher to demonstrate that the typical
Dependence in IV-related bytes of RC4 key enhances vulnerabilities in WPA?
"... Abstract. The first three bytes of the RC4 key in WPA are public as they are derived from the public parameter IV, and this derivation leads to a strong mutual dependence between the first two bytes of the RC4 key. In this paper, we provide a disciplined study of RC4 biases result-ing specifically i ..."
Abstract
- Add to MetaCart
to the dependence of the first two bytes of the RC4 key in WPA, both derived from the same byte of the IV. Our result on the nature of the first keystream byte provides a significantly improved distinguisher for RC4 used in WPA than what had been pre-sented by Sepehrdad et al. (2011-12). Further, we revisit
(Non-)Random Sequences from (Non-)Random Permutations- Analysis of RC4 stream cipher
"... RC4 has been the most popular stream cipher in the history of symmetric key cryptography till date. Its internal state contains a pseudo-random permutation over all n-bit words (typically n = 8) and it attempts to generate a pseudo-random sequence of words by extracting elements of this permutatio ..."
Abstract
-
Cited by 13 (6 self)
- Add to MetaCart
the observation by Mironov [CRYPTO 2002]. Further, the existence of positive biases towards zero for all the initial bytes 3 to 255 is proved and exploited towards a generalized broadcast attack on RC4 stream cipher.
Results 1 - 10
of
28