Author:
Cardell Sara Díaz,Fúster-Sabater Amparo
Publisher
Springer International Publishing
Reference16 articles.
1. Blackburn, S.R.: The linear complexity of the self-shrinking generator. IEEE Trans. Inf. Theory 45(6), 2073–2077 (1999).
https://doi.org/10.1109/18.782139
2. Cardell, S.D., Fúster-Sabater, A.: Modelling the shrinking generator in terms of linear CA. Adv. Math. Commun. 10(4), 797–809 (2016).
https://doi.org/10.3934/amc.2016041
3. Cardell, S.D., Fúster-Sabater, A.: Discrete linear models for the generalized self-shrunken sequences. Finite Fields Appl. 47, 222–241 (2017).
https://doi.org/10.1016/j.ffa.2017.06.010
4. Cardell, S.D., Fúster-Sabater, A.: Recovering decimation-based cryptographic sequences by means of linear CAs (2018).
https://arxiv.org/abs/1802.02206
5. Coppersmith, D., Krawczyk, H., Mansour, Y.: The shrinking generator. In: Stinson, D. (ed.) Advances in Cryptology – CRYPTO ’93. Lecture Notes in Computer Science, vol. 773, pp. 22–39. Springer, Berlin (1994).
https://doi.org/10.1007/3-540-48329-2_3