1. Cardell, S.D., Fúster-Sabater, A.: Linear models for the self-shrinking generator based on CA. J. Cell. Automata 11(2–3), 195–211 (2016)
2. Cardell, S.D., Fúster-Sabater, A.: Recovering decimation-based cryptographic sequences by means of linear CAs (2018).
https://arxiv.org/abs/1802.02206
3. Cardell, S.D., Fúster-Sabater, A., Ranea, A.: Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator. Open Math. 16(1), 646–655 (2018).
https://doi.org/10.1515/math-2018-0058
4. Ekdahl, P., Meier, W., Johansson, T.: Predicting the shrinking generator with fixed connections. In: Biham, E. (ed.) Advances in Cryptology-EUROCRYPT’2003. Lecture Notes in Computer Science, vol. 2656, pp. 330–344. Springer, Berlin, Heidelberg (2003).
https://doi.org/10.1007/3-540-39200-9_20
5. Fúster-Sabater, A., Caballero-Gil, P.: Strategic attack on the shrinking generator. Theor. Comput. Sci. 409(3), 530–536 (2008).
https://doi.org/10.1016/j.tcs.2008.09.030