On the Entropy of Arcfour Keys (ResearchIndex)

See this document in CiteSeerX!

On the Entropy of Arcfour Keys (1998) (Make Corrections)
Luke O'Connor

Rate this article:

(Enter summary)
Abstract: Arcfour is a stream cipher that produces a byte keystream B = fb i g i=0 , where a key K is used to select the initial state S 0 , and the b i are produced by the state transition ffi(S i ) = S i+1 . Let the byte length of K be jKj, and let S 0 (K) be the initial state produced by K. Two keys K 1 ; K 2 are considered equivalent if S 0 (K 1 ) = S 0 (K 2 ), and further K 2 is weak if jK 1 j ! jK 2 j. We show that there is a class of weak keys based on the notion of string periodicity which... (Update)

Similar documents (at the sentence level):
77.8%: Rz 3019 ( 93065)05/5) - Computerscience Pages Research (2005) (Correct)

Active bibliography (related documents): More All
0.3: Mercy: A Fast Large Block Cipher for Disk Sector Encryption - Crowley (2000) (Correct)
0.0: Saving Comparisons in the Crochemore-Perrin String Matching.. - Breslauer (1995) (Correct)
0.0: The Expected Number of Missing Words in a Random Text - Rahmann, Rivals (2000) (Correct)

Similar documents based on text: More All
1.3: Why Chosen Ciphertext Security Matters - Shoup (1998) (Correct)
1.3: Fairness in Electronic Commerce - Asokan (1998) (Correct)
1.3: Towards A Framework for Handling Disputes in Payment.. - Asokan, Van Herreweghen, .. (1998) (Correct)

BibTeX entry: (Update)

@misc{ o'connor-entropy,
  author = "Luke O'Connor",
  title = "On the Entropy of Arcfour Keys",
  url = "citeseer.ist.psu.edu/544739.html" }