Study Of Algorithm For Fast Software Generation Of Generalized Self-Shrinking Sequences

Since the data transmission rate has been growing exponentially in the last decade, advances in the area of high-speed software and hardware algorithms are needed in order to provide adequate security in the future. The problem of software generation algorithm of the Generalized Self-Shrinking sequence is considered in this paper. The first chapter introduces the Generalized Self-Shrinking Sequences and the state of art of the fast software stream cipher. The second chapter elaborates on the mathematical foundation of stream cipher, and then discusses the properities of the Generalized Self-Shrinking (GSS) sequence. Our contributions are given in the last two chapters.1. The bottleneck of Generalized Self-Shrinking Sequences is analyzed. By taking advatange of the good mathematical sturcutre of the m sequence, we transform the GSS generation problem to the problem of efficient m sequence generation. Three efficient alorithms are explored to solve the problem and the strength and weakness of each algorithm are discussed in detail.2. A new efficient parallized algorithm with low space complexity is proposed and an av-combined model is explored to make the algorithm more efficient.. A comparison of the experiment result shows that GSS is competitive with other popular fast stream cipher schemes such as SSC2,LILI,SOBBER.