Abstract
The use of basic crypto-primitives or building blocks has a vital role in the design of secure crypto algorithms. Such crypto primitives must be analyzed prior to be incorporated in crypto algorithm. In cryptanalysis of any crypto algorithm, a cryptanalyst generally deals with intercepted crypts without much auxiliary information available to recover plaintext or key information. As brute force attack utilizes all possible trials exhaustively, it has high computing time complexity due to huge search space and hence is practically infeasible to mount on secure crypto algorithms. The Geffe generator is a non-linear binary key sequence generator. It consists of three linear feedback shift registers and a nonlinear combiner. In this paper, we attempt Geffe generator to find initial states of all three shift registers used. The initial states are the secret key bits that maintain the security of Geffe generator. To find secret key bits, one has to search huge key space exhaustively. We consider divide-and-conquer attack and genetic algorithm to reduce exhaustive searches significantly. Simulation results show that correct initial states of all shift registers can be obtained efficiently.
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
Similar content being viewed by others
References
Stallings, W.: Cryptography and Network Security. Pearson, London (2012)
Menzes, A., Oorschot, P.V., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Geffe, P.R.: How to protect data with ciphers that are really hard to break. Electronics 46(1), 99–101 (1973)
Klein, A.: Stream Ciphers. Springer, London (2013)
Wei, S.: On generalization of Geffe generator. Int. J. Comput. Sci. Netw. Sec. 6(8A), 161–165 (2006)
Jenner, E.: Cryptanalysis of LFSR-based pseudorandom generators—a survey. http://www.erikzenner.name/docs/2004_survey_streamcipher.pdf (2004)
Golic, J.D.: Correlation properties of a general combiner with memory. J. Cryptol. 9(2), 111–126 (1996)
Penzhorn, W.T., Bruwer, C.S.: New correlation attacks on stream ciphers. In: Proceedings of IEEE AFRICON 2002, pp. 203–208 (2002)
Meier, W., Staffelbach, O.: Fast correlation attacks on stream ciphers. In: Advances in Cryptology—EUROCRYPT ‘88, LNCS 330, pp. 301–314 (1988)
Kholosha, A.: Investigations in the design and analysis of key-stream generator. http://alexandria.tue.nl/extra2/200410591.pdf
Dawson, E., Clark, A.: Divide and conqure attack on certain classes of stream ciphers. Cryptologia 18(1), 25–40 (1994)
Luengo, I.: Linear and non-linear sequences and applications to stream ciphers. Recent Trends Crypt.—Contemp. Math. 477, 21–46 (2009)
Davis, L.: The Handbook of Genetic Algorithms. Van Nostrand Reinhold, New Jersey (1991)
Coley, D.A.: An Introduction to Genetic Algorithms for Scientists and Engineers. World Scientific, New Jersey (1999)
Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley, New Jersey (1998)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Boston (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Din, M., Bhateja, A.K., Ratan, R. (2014). Cryptanalysis of Geffe Generator Using Genetic Algorithm. In: Pant, M., Deep, K., Nagar, A., Bansal, J. (eds) Proceedings of the Third International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 259. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1768-8_45
Download citation
DOI: https://doi.org/10.1007/978-81-322-1768-8_45
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1767-1
Online ISBN: 978-81-322-1768-8
eBook Packages: EngineeringEngineering (R0)