Radwa Mahmoud Mohamed Marzouk <br/><br/>
Algorithms for complexity measures of periodic sequences over finite fields /  
 خوارزميات لقياسات تعقيدات المتتابعات الدورية المعرفة على الحقول المنتهية 
Radwa M. Marzouk ; Supervised Laila F. Abdelal , Hassan A. Aly 
 - Cairo :   Radwa Mahmoud Mohamed Marzouk ,   2012 
 - 108 Leaves ;   25cm 
<br/><br/>Thesis (Ph.D.) - Cairo University - Faculty of Science - Department of Mathematics 
<br/><br/> The linear complexity and the k-error linear complexity for periodic sequences over a finite field play an important role as unpredictability criteria in stream ciphers applications. Periodic sequences that are suitable as keystreams in stream ciphers should possess a large linear complexity to thwart an attack by the Berlekamp-Massey algorithm 
<br/><br/>
<br/><br/><label>Subjects--Index Terms: </label>Algorithms K-error linear complexity Linear complexity