Abstract
Algebraic attacks have been developed against symmetric primitives during the last decade. In this paper we represent equation systems using binary decision diagrams, and explain techniques for solving them. Next, we do experiments with systems describing reduced versions of DES and AES, as well as systems for the problem of determining EA-equivalence. We compare our results against Gröbner basis and CryptoMiniSat.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656–715 (1949)
Raddum, H., Semaev, I.: Solving multiple right hand sides linear equations. Des. Codes Crypt. 49(1–3), 147–160 (2008). Springer
Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)
Courtois, N.T., Bard, G.V., Wagner, D.: Algebraic and slide attacks on KeeLoq. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 97–115. Springer, Heidelberg (2008)
Courtois, N.T., Bard, G.V.: Algebraic cryptanalysis of the data encryption standard. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 152–169. Springer, Heidelberg (2007)
Helleseth, T., Rønjom, S.: Simplifying algebraic attacks with univariate analysis, Information Theory and Applications Workshop (ITA), pp. 1–7. IEEE (2011)
Cid, C., Murphy, S., Robshaw, M.: Small scale variants of the AES. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 145–162. Springer, Heidelberg (2005)
Bard, G.V.: Algebraic Cryptanalysis. Springer, Heidelberg (2009)
Albrecht, M.: Algorithmic Algebraic Techniques and Their Application to Block Cipher Cryptanalysis, University of London, Thesis (2010). http://www.sagemath.org/files/thesis/albrecht-thesis-2010.pdf
Daum, M.: Cryptanalysis of Hash functions of the MD4-family, Ruhr University Bochum, Thesis (2005). http://www.cits.ruhr-uni-bochum.de/imperia/md/content/magnus/dissmd4.pdf
Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38, 985–999 (1959)
Knuth, D.E.: The Art of Computer Programming Volume 4, Fascicle 1: Bitwise tricks and techniques; Binary Decision Diagrams, Addison-Wesley Professional (2009)
Krause, M.: BDD-Based cryptanalysis of keystream generators. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 222–237. Springer, Heidelberg (2002)
Stegemann, D.: Extended BDD-based cryptanalysis of keystream generators. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 17–35. Springer, Heidelberg (2007)
Kleiman, E.: High Performance Computing techniques for attacking reduced version of AES using XL and XSL methods, Graduate Theses and Dissertations (2010). http://lib.dr.iastate.edu/etd/11473
Bulygin, S., Brickenstein, M.: Obtaining and solving systems of equations in key variables only for the small variants of AES. Math. Comput. Sci. 3(2), 185–200 (2010). Birkhäuser-Verlag
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677–691 (1986)
Schilling, T.E., Raddum, H.: Solving compressed right hand side equation systems with linear absorption. In: Helleseth, T., Jedwab, J. (eds.) SETA 2012. LNCS, vol. 7280, pp. 291–302. Springer, Heidelberg (2012)
Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: IEEE/ACM International Conference on Computer-aided Design, vol. 12, pp. 42–47 (1993)
Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993–1002 (1996)
Perret, J.C.F.L., Spaenlehauer, P.J.: Algebraic Differential Cryptanalysis of DES, Western European Workshop on Research in Cryptology (2009). http://www.pjspaenlehauer.net/data/papers/DESweworc.pdf
Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Federal Information Processing Standards Publication (FIPS PUB) 46. National Bureau of Standards, Washington (1977)
Phan, R.C.-W.: Mini advanced encryption standard (Mini-AES): a testbed for cryptanalysis students. Cryptologia 26(4), 283–306 (2002). Taylor & Francis
Kleiman, E.: The XL and XSL attacks on Baby Rijndael, Master Thesis, Iowa State University (2005). https://orion.math.iastate.edu/dept/thesisarchive/MS/EKleimanMSSS05.pdf
Announcing the Advanced Encryption Standard (AES), Federal Information Processing Standards Publication 197, United States National Institute of Standards and Technology (NIST) (2001)
Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244–257. Springer, Heidelberg (2009)
Stein, W., et al.: Sage mathematics software (version 6.2). The Sage Development Team (2014). http://www.sagemath.org
Budaghyan, L., Kazymyrov, O.: Verification of restricted EA-equivalence for vectorial boolean functions. In: Özbudak, F., Rodríguez-Henríquez, F. (eds.) WAIFI 2012. LNCS, vol. 7369, pp. 108–118. Springer, Heidelberg (2012)
Eilertsen, A.M., Kazymyrov, O., Kazymyrova, V., Storetvedt, M.: A Sage library for analysis of nonlinear binary mapping. In: Pre-proceedings of Central European Conference on Cryptology (CECC14), pp. 69–78 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Raddum, H., Kazymyrov, O. (2015). Algebraic Attacks Using Binary Decision Diagrams. In: Ors, B., Preneel, B. (eds) Cryptography and Information Security in the Balkans. BalkanCryptSec 2014. Lecture Notes in Computer Science(), vol 9024. Springer, Cham. https://doi.org/10.1007/978-3-319-21356-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-21356-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21355-2
Online ISBN: 978-3-319-21356-9
eBook Packages: Computer ScienceComputer Science (R0)