This question already has an answer here:
- Stream Ciphers and cycling questions 1 answer
could someone tell me how long the cycle length must be in stream ciphers, so a security exists. how to compare the cycle length to the state space?
I investigate the algorithm spritz and I have the attainability of the states under investigation with key lengths of 1 - 10 and n = 6. now I have the values but I still do not know how to interpret them. the maximum cycle length for N = 6 is 660.390 and the smallest 12. But how should I evaluate this with regard to the safety? I hope I have described it somewhat better.