A Tutorial on High Performance Computing Applied to Cryptanalysis
Cryptology and computers have a long common history; in fact, some of the early computers were created as cryptanalytic tools. The development of faster and widely deployed computers also had a great impact on cryptology, allowing modern cryptography to become a practical tool. Today, both computers and cryptology are not only practical, but they have became ubiquitous tools. In truth, computing devices incorporating cryptography features range from very small low-end devices to supercomputer, going through all possible intermediate sizes; these devices include both general purpose computing devices and specific, often embedded, processors which enable computing and security features in hundreds of technological objects.
In this invited talk, we mostly consider the cryptanalytic side of things, where it is fair to use very large amounts of computing power to break cryptographic primitives or protocols. As a consequence, demonstrating the feasibility of new cryptanalytic methods often requires large scale computations. Most articles describing such cryptanalyses usually focus on the mathematical or algorithmic advances and gloss over the implementation details, giving only sufficient data to show that the computations are feasible. The goal of the present abstract is to give an idea of the difficulty facing implementers of large scale cryptanalytic attacks.
KeywordsRecord Computation Large Scale Computation High Performance Computing Apply Lattice Basis Reduction Hardware Context
- 2.Backes, W., Wetzel, S.: Parallel lattice basis reduction - the road to many-core. In: Thulasiraman, P., Yang, L.T., Pan, Q., Liu, X., Chen, Y.-C., Huang, Y.-P., Chang, L.H., Hung, C.-L., Lee, C.-R., Shi, J.Y., Zhang, Y. (eds.) 13th IEEE International Conference on High Performance Computing & Communication, pp. 417–424. IEEE (2011)Google Scholar
- 3.Bernstein, D.J.: Better price-performance ratios for generalized birthday attacks (2007), http://cr.yp.to/rumba20/genbday-20070904.pdf
- 7.Hamadi, Y. (ed.). Special issue on parallel SAT solving. Journal on Satisfiability, Boolean Modeling and Computation 6, 203–262 (2009)Google Scholar
- 8.Faugère, J.-C., Lachartre, S.: Parallel Gaussian elimination for Gröbner bases computations in finite fields. In: Maza, M.M., Roch, J.-L. (eds.) Proceedings of the 4th International Workshop on Parallel Symbolic Computation, pp. 89–97. ACM (2010)Google Scholar
- 9.Electronic Frontier Foundation. Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design. O’Reilly & Associates, Inc. (1998)Google Scholar
- 15.Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thomé, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-Bit RSA Modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333–350. Springer, Heidelberg (2010)Google Scholar
- 16.Kleinjung, T., Lenstra, A.K., Page, D., Smart, N.P.: Using the cloud to determine key strengths. IACR Cryptology ePrint Archive, p. 254 (2011)Google Scholar
- 17.Kleinjung, T., Nussbaum, L., Thomé, E.: Using a grid platform for solving large sparse linear systems over gf(2). In: Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, pp. 161–168. IEEE (2010)Google Scholar