SAT-based cryptanalysis of modified versions of Feistel Network

• Autorzy: Dudek P. , Kurkowski M.
• Języki publikacji: EN

Abstrakty

EN

It is well known that Feistel Network (FN) is the foundation of many symmetric ciphers used in practice. In this paper we present some remarks and experimental results on SAT based cryptanalysis of several modified versions of FN. We investigate different cryptographic functions used in FN schema for better understanding their properties from a security point of view. In our work we study the notions widely used in many ciphers: the xor function, bits rotations, permutations and S-boxes.

Słowa kluczowe

EN

Feistel network; sat-based cryptanalysis; cryptographic functions

PL

sieć Feistela; satelitarna kryptoanaliza; funkcje kryptograficzne

• Wydawca: Wydawnictwo Uniwersytetu Humanistyczno-Przyrodniczego im. Jana Długosza w Częstochowie
• Czasopismo: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
• Rocznik: 2011
• Tom: Vol. 16
• Strony: 103--110
• Opis fizyczny: Bibliogr. 9 poz., tab.

Twórcy

autor

Dudek P.

• Institute of Computer and Information Sciences Częstochowa University of Technology ul. Dąbrowskiego 73, 42-200 Częstochowa, Poland

autor

Kurkowski M.

• Institute of Computer and Information Sciences Częstochowa University of Technology ul. Dąbrowskiego 73, 42-200 Częstochowa, Poland

Bibliografia

• [1] A. Armando, L. Compagna. Sat-based model-checking for security protocols analysis. Int. J. Information Security, 7(1), 3-32, 2008.
• [2] A. Biere, M. Heule, H. van Maaren, T.Walsh. Handbook of Satisfiability, vol. 185 of Frontiers in Artifical Intelligence and Applications. IOS Press, Amsterdam 2009.
• [3] N. Courtois, G. V. Bard. Algebraic cryptanalysis of the data encryption standard. In: Proc. of the 11th IMA Int. Conf. on Cryptography and Coding, vol. 4887 LNCS, pp. 152-169, Springer, Berlin 2007.
• [4] M. Davis, G. Logemann, D. W. Loveland. A machine program for theoremproving. Commun. ACM, 5(7), 394-397, 1962.
• [5] M. Davis, H. Putnam. A computing procedure for quantification theory. J. ACM, 7(3), 201-215, 1960.
• [6] P. Dudek, M. Kurkowski, M. Srebrny. Towards parallel direct SAT-based cryptanalysis. Proc. of PPAM'11, LNCS, Springer (accepted).
• [7] M. Kurkowski, W. Penczek, A. Zbrzezny. SAT-based verification of security protocols using networks of automata. In: Proc. of MoChArt'06, vol. 4428 LNCS, pp. 146-165, Springer, Berlin 2007.
• [8] F. Massaci. Using Walk-SAT and Rel-SAT for cryptographic key search. In: T. Dean (ed.), Proc. of 16th Int. Joint Conf. on Artifical Intelligence, pp. 290-295, Morgan Kaufmann Publishers, San Franciso 1999.
• [9] A. Menezes, P.C. van Oorschot, S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton 1996.