Abstract
In this paper we analyze the recently proposed lightweight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCipher-48 and 9 rounds under some additional assumptions with only 2 known plaintexts faster than brute force. We show that it is possible to break the full 48-round cipher by assuming a moderate leakage of internal state bits or even just Hamming weights of some three-bit states. Such a simulation side-channel attack has practical complexity.
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
Preview
Unable to display preview. Download preview PDF.
References
Knudsen, L., Leander, G., Poschmann, A., Robshaw, M.J.B.: PRINTCipher: A Block Cipher for IC-Printing. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 16–32. Springer, Heidelberg (2010)
Bogdanov, A.A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: An Ultra-Lightweight Block Cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450–466. Springer, Heidelberg (2007)
De Cannière, C., Dunkelman, O., Knežević, M.: KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 272–288. Springer, Heidelberg (2009)
Abdelraheem, M.A., Leander, G., Zenner, E.: Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 1–17. Springer, Heidelberg (2011)
Leander, G., Abdelraheem, M.A., AlKhzaimi, H., Zenner, E.: A Cryptanalysis of PRINTCipher: The Invariant Coset Attack. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 206–221. Springer, Heidelberg (2011)
Zhao, X., Wang, T., Guo, S.: Fault Propagate Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTCipher. ePrint, http://eprint.iacr.org/2011/086.pdf
Soos, M.: Grain of Salt - An Automated Way to Test Stream Ciphers through SAT Solvers, http://www.msoos.org/grain-of-salt
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)
Bard, G.V., Courtois, N.T., Nakahara Jr, J., Sepehrdad, P., Zhang, B.: Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 176–196. Springer, Heidelberg (2010)
Bouillaguet, C., Derbez, P., Dunkelman, O., Keller, N., Fouque, P.-A.: Low Data Complexity Attacks on AES. ePrint, http://eprint.iacr.org/2010/633.pdf
Renauld, M., Standaert, F.-X.: Algebraic Side-Channel Attacks. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds.) Inscrypt 2009. LNCS, vol. 6151, pp. 393–410. Springer, Heidelberg (2010)
Renauld, M., Standaert, F.-X.: Combining Algebraic and Side-Channel Cryptanalysis against Block Ciphers. In: Proceedings of the 30th Symposium on Information Theory in the Benelux (2009)
Collard, B., Standaert, F.-X.: A Statistical Saturation Attack against the Block Cipher PRESENT. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 195–211. Springer, Heidelberg (2009)
Albrecht, M.: Algorithmic Algebraic Techniques and their Application to Block Cipher Cryptanalysis. Ph.D. thesis. Royal Holloway, University of London, http://www.sagemath.org/files/thesis/albrecht-thesis-2010.pdf
Een, N., Sorensson, N.: An Extensible SAT-Solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Soos, M.: CryptoMiniSat – a SAT solver for cryptographic problems, http://planete.inrialpes.fr/~soos/CryptoMiniSat2/index.php
Bard, G.V.: Algebraic Cryptanalysis. Springer, Heidelberg (2009)
Brickenstein, M.: Boolean Gröbner bases – Theory, Algorithms and Applications, Logos Berlin (2010)
William Stein, S., et al.: SAGE Mathematics Software. The Sage Development Team (2008), http://www.sagemath.org
Albrecht, M., Soos, M.: Boolean Polynomial SAT-Solver, http://bitbucket.org/malb/algebraic_attacks/src/tip/anf2cnf.py
Brickenstein, M.: PolyBoRi’s CNF converter, https://bitbucket.org/malb/algebraic_attacks/src/013dd1b793e8/polybori-cnf-converter.py
Karnaugh, M.: The map method for synthesis of combinational logic circuits. Transactions of American Institute of Electrical Engineers part I 72(9), 593–599 (1953)
Bulygin, S.: Algebraic cryptanalysis of the round-reduced and side channel analysis of the full PRINTCipher-48 (2011), http://eprint.iacr.org/2011/287
Albrecht, M., Cid, C., Dullien, T., Faugère, J.-C., Perret, L.: Algebraic Precomputations in Differential and Integral Cryptanalysis. In: Lai, X., Yung, M., Lin, D. (eds.) Inscrypt 2010. LNCS, vol. 6584, pp. 387–403. Springer, Heidelberg (2011)
Gomes, C.P., Sabharwal, A., Selman, B.: Model Counting. In: Handbook of Satisfiability, pp. 633–654. IOS Press (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bulygin, S., Buchmann, J. (2011). Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48. In: Lin, D., Tsudik, G., Wang, X. (eds) Cryptology and Network Security. CANS 2011. Lecture Notes in Computer Science, vol 7092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25513-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-25513-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25512-0
Online ISBN: 978-3-642-25513-7
eBook Packages: Computer ScienceComputer Science (R0)