The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2010  
         
  Article:   SOME COMBINATORIAL ASPECTS OF THE KSAm-LIKE ALGORITHMS SUITABLE FOR RC4 STREAM CIPHER.

Authors:  FLORIAN MIRCEA BOIAN.
 
       
         
  Abstract:  RC4 remains one of the most widely used stream cipher. In order to face the main critical weaknesses, a number of proposals for modifying RC4 algorithm have been advanced. In this paper we analyze some combinatorial aspects regarding the randomness of a variant of the Key-Scheduling Algorithm (KSA), called KSAm, proposed by Crainicu and Boian in [2] as a better protection against Initialization Vectors (IVs) weakness of Wired Equivalent Privacy (WEP) cryptosystems. Based on a model presented by Mironov in [19], we calculate the sign of the entries'' permutation of the internal state table S after KSAm, which provides a negligible advantage of guessing a particular bit. Then, we analyze the probability of the event where a particular initial value follows a linear forward movement through the vector S, with possible undesirable consequences in predicting the value during that movement.

Key words and phrases: KSA, KSAm, RC4, sign of permutation, randomness of state table.
 
         
     
         
         
      Back to previous page