one of the important statistical test that using the linear complexity profile (LCP) of the sequences of stream cipher systems to know the strength of this cipher system ....that means the LCP have some useful characteristics may be used in the cryptanalysis .
Not sure exactly what you are asking, but have you run across this article?
Article 1-Error Linear Complexity Test for Binary Sequences
My approach is to test the cipher text for randomness, sure. Even under special conditions, such as a string of the same character in the plaintext, or any type of repeated pattern in the plaintext.
An important consideration is also, of course, the length of the pseudo-random sequence, used in the encryption and decryption processes, before the pseudo-random sequence repeats (as they all will). Because you want to avoid recycling the same PRNG sequence, if the plaintext is longer than the pseudo-random string of numbers. Best to use a different seed, rather than recycling.
I think any linear complexity profile can not provide a full analysis of strong cipher systems. Basically, they must be in exponentially order complexity.
i use computational complexity for analysis of different types of signature scheme
- Badges
- Science topic