Abstract
Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudo-random number generators, are widely used in cryptographic network protocols. Basically, they are finite state machines with deterministic transition functions. Their state transition graphs typically cannot be analyzed analytically, nor can they be explored completely because of their size which typically is at least n = 264. Yet, their structure, i.e. number and sizes of weakly connected components, is of interest because a structure deviating significantly from expected values for random graphs may form a distinguishing attack that indicates a weakness or backdoor. By sampling, one randomly chooses k nodes, derives their distribution onto connected components by graph exploration, and extrapolates these results to the complete graph. In known algorithms, the computational cost to determine the component for one randomly chosen node is up to O(√n), which severely restricts the sample size k. We present an algorithm where the computational cost to find the connected component for one randomly chosen node is O(1), so that a much larger sample size k can be analyzed in a given time. We report on the performance of a prototype implementation, and about preliminary analysis for several generators.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Biryukov, A., Shamir, A., Wagner, D.: Real time cryptanalysis of A5/1 on a PC. In: Fast Software Encryption Workshop 2000, Springer LNCS (2001) 1–18
Eberspächer, J., Vögel, H.J., Bettstetter, C.: GSM — Global System for Mobile Communication. 3rd edn. Teubner-Verlag (2001)
Keller, J.: Parallel exploration of the structure of random functions. In: 6th Workshop on Parallel Systems and Algorithms (PASA), VDE (2002) 233–236
Heichler, J., Keller, J., Sibeyn, J.F.: Parallel storage allocation for intermediate results during exploration of random mappings. In: 20th Workshop Parallel Algorithms, Strctures and System Software (PARS). GI (2005) 126–134
Flajolet, P., Odlyzko, A.M.: Random mapping statistics. In: EUROCRYPT’ 89, Springer LNCS (1990) 329–354
Heichler, J., Keller, J.: A distributed query structure to explore random mappings in parallel. In: 14th Euromicro Conference on Parallel, Distributed and Network-based Processing. IEEE CS (2006) 173–177
Schneier, B.: Applied Cryptography. Wiley (1995)
Wolfram, S.: Cryptography with cellular automata. In: Proc. Crypto’ 85, Springer LNCS (1985) 429–432
Meier, W., Staffelbach, O.: Analysis of pseudo random number sequences generated by cellular automata. In: Proc. Eurocrypt’ 91, Springer LNCS (1991) 186–189
Gong, G.: ECE 710 Sequence design and cryptography (Fall 2005) lecture slides. http://calliope.uwaterloo.ca/~ggong/ECE710T4/lec8-ch6b.pdf
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this paper
Cite this paper
Keller, J. (2007). Efficient Sampling of the Structure of Crypto Generators’ State Transition Graphs. In: EC2ND 2006. Springer, London. https://doi.org/10.1007/978-1-84628-750-3_1
Download citation
DOI: https://doi.org/10.1007/978-1-84628-750-3_1
Publisher Name: Springer, London
Print ISBN: 978-1-84628-749-7
Online ISBN: 978-1-84628-750-3
eBook Packages: Computer ScienceComputer Science (R0)