Computing on the joint quadratic complexity of multiple periodic sequences

Abstract

An algorithm for determining the joint quadratic complexity of the prescribed multiple periodic sequences over any finite field was presented by using the algorithm for computing the quadratic complexity of the prescribed single sequence proposed by Rizomiliotis and the methods for determining the solutions of the linear equations.The total processing time requirement is cubics function of the sequence length at most.

Keywords

• cryptography;stream cipher;quadratic complexity;multiple sequences