Abstract
The class of decimation-based sequence generators attempts to obtain an implicit non-linearity from the decimation process. In this work, it is shown that the output sequence of a well known member of this generator class, the shrinking generator, is composed of PN-sequences generated by Linear feedback Shift Registers. Furthermore, these PN-sequences are shifted versions of a unique sequence whose initial positions can be determined using discrete logarithms. Taking advantage of the linearity of the PN-sequences, a method of recovering the whole output sequence from a small number of intercepted bits is proposed. The algorithm is deterministic, always finds the cryptosystem key and is very adequate for parallelization. The basic ideas of this work can be generalized to other elements in the same class of sequence generators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Coppersmith, D., Krawczyk, H., Mansour, Y.: The shrinking generator. In: Advances in Cryptology – CRYPTO 1993. Lecture Notes in Computer Science, vol. 773, pp. 23–39. Springer (1993)
Ekdahl, P., Johansson, T.: Predicting the shrinking generator with fixed connections. In: Advances in Cryptology-EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656, pp. 330–344. Springer, Berlin (2003)
Zhang, B., Wu, H., Feng, D., Bao, F.: A fast correlation attack on the shrinking generator. In: Menezes, A.J. (ed.) Topics in Cryptology - CT-RSA 2005. Lecture Notes in Computer Science, vol. 537, pp. 72–86. Springer, Berlin (2005)
Golić, J.D.: Embedding and probabilistic correlation attacks on clock-controlled shift registers. In: Advances in Cryptology-EUROCRYPT 1994. Lecture Notes in Computer Science, vol. 950, 230–243. Springer, Berlin (1994)
Molland, H.: Improved linear consistency attack on irregular clocked keystream generators. In: Fast Software Encryption-FSE 2004. Lecture Notes in Computer Science, vol. 3017, pp. 109–126. Springer (2004)
Cardell, S.D., Fúster-Sabater, A.: Linear models for the self-shrinking generator based on CA. J. Cell. Autom. 11(2–3), 195–211 (2016)
Cardell, S.D., Fúster-Sabater, A.: Modelling the shrinking generator in terms of linear CA. Adv. Math. Commun. 10(4), 797–809 (2016)
Fúster-Sabater, A., Caballero-Gil, P.: Linear solutions for cryptographic nonlinear sequence generators. Phys. Lett. A 369, 432–437 (2007)
Huber, K.: Some comments on Zech’s logarithms. IEEE Trans. Inf. Theory 36(4), 946–950 (1990)
Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)
Fúster-Sabater, A.: Generation of cryptographic sequences by means of difference equations. Appl. Math. Inf. Sci. 8(2), 475–484 (2014)
Barbulescu, R., Bouvier, C., Detrey, J., Gaudry, P., Jeljeli, H., Thomé, E., Videau, M., Zimmermann, P.: Discrete logarithm in GF(2\(^{809}\)) with FFS. In: Krawczyk, H. (ed.) Public-Key Cryptography - PKC 2014: Proceedings of the 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, 26–28 March 2014, pp. 221–238. Springer, Heidelberg (2014)
Barbulescu, R., Gaudry, P., Joux, A., Thomé, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) Eurocrypt 2014, vol. 8441, pp. 1–16. Springer, Copenhagen (2014)
Mullen, G.L., Panario, D.: Handbook of Finite Fields, 1st edn. Chapman & Hall/CRC, London (2013)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)
Simpson, L., Golić, J.D.: A probabilistic correlation attack on the shrinking generator. In: ACISP 1998 – Third Australasian Conference on Information Security and Privacy. Lecture Notes in Computer Science, vol. 1438, pp. 147–158. Springer, Berlin (1998)
Johansson, T.: Reduced complexity correlation attacks on two clock-controlled generators. In: Advances in Cryptology – ASIACRYPT 1998. Lecture Notes in Computer Science, vol. 1514, pp. 342–357. Springer, Berlin (1998)
Golić, J.D.: Correlation analysis of the shrinking generator. In: Advances in Cryptology-Crypto 2001. Lecture Notes in Computer Science, vol. 2139, pp. 440–457. Springer, Berlin (2001)
Krawczyk, H.: The shrinking generator: some practical considerations. In: Fast Software Encryption-FSE 1994. Lecture Notes in Computer Science, vol. 809, pp. 45–46. Springer, Berlin (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Cardell, S.D., Fúster-Sabater, A., Bin, L. (2018). A New Simple Attack on a Wide Class of Cryptographic Sequence Generators. In: Pérez García, H., Alfonso-Cendón, J., Sánchez González, L., Quintián, H., Corchado, E. (eds) International Joint Conference SOCO’17-CISIS’17-ICEUTE’17 León, Spain, September 6–8, 2017, Proceeding. SOCO ICEUTE CISIS 2017 2017 2017. Advances in Intelligent Systems and Computing, vol 649. Springer, Cham. https://doi.org/10.1007/978-3-319-67180-2_52
Download citation
DOI: https://doi.org/10.1007/978-3-319-67180-2_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67179-6
Online ISBN: 978-3-319-67180-2
eBook Packages: EngineeringEngineering (R0)