Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.1 din 2010  
         
  Articol:   SOME COMBINATORIAL ASPECTS OF THE KSAm-LIKE ALGORITHMS SUITABLE FOR RC4 STREAM CIPHER.

Autori:  FLORIAN MIRCEA BOIAN. 		 
       
         
  Rezumat:  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.
  
         
     
         
         
      Revenire la pagina precedentă