On differential properties of a symmetric cryptoalgorithm based on pseudo-dynamic substitutions

A. A. Kozhevnikov   ; S. V. Polikarpov   ; K. E. Rumyantsev

Matematičeskie voprosy kriptografii, Tome 7 (2016) no. 2, pp. 91-102

Résumé

A general structure of a block cryptoalgorithm “Collapser” based on pseudo-dynamic substitutions is proposed. Such approach allows to combine advantages of fixed substitutions (high speed implementation and efficient usage of computational resources) and dynamic substitutions (neutralization of statistical methods of cryptanalysis). The differential properties of reduced version of “Collapser” are compared with ones of random substitutions of similar order. It is shown that after 3 rounds “Collapser” looks as a random substitution.

Bibliographie

[1] Preneel B., Biryukov A., De Canni'ere C., Örs S. B., Oswald E., Van Rompay B., Granboulan L., Dottax E., Martinet G., Murphy S., Dent A., Shipsey R., Swart C., White J., Dichtl M., Pyka S., Schafheutle M., Serf P., Biham E., Barkan E., Braziler Y., Dunkelman O., Furman V., Kenigsberg D., Stolin J., Quisquater J.-J., Ciet M., Sica F., Raddum H., Knudsen L., Parker M., Final report of European project number IST-1999-12324, named New European Schemes for Signatures, Integrity, and Encryption, April 19, 2004 - Version 0.15 (beta), 2004, iii+829 pp. https://www.cosic.esat.kuleuven.be/nessie/Bookv015.pdf

[2] Matsui M., “Linear cryptoanalysis method for DES cipher”, Advances in Cryptology-EUROCRYPT'93, Lect. Notes Comput. Sci., 765, 1994, 386–397 | DOI | Zbl

[3] Biham E., Shamir A., “Differential cryptanalysis of DES-like cryptosystems”, J. Cryptology, 4:1 (1991), 3–72 | DOI | MR | Zbl

[4] Braeken A., Nikov V., Nikova S., Preneel B., “On Boolean functions with generalized cryptographic properties”, Progress in Cryptology-INDOCRYPT 2004, Lect. Notes Comput. Sci., 3348, 2005, 120–135 | DOI | MR

[5] Dolgov V. I., Kuznetsov A. A., Isaev S. A., “Differential properties of block symmetric ciphers”, Elektr. modelir., 33:6 (2011), 81–99 (in Russian)

[6] Gorbenko I. D., Dolgov V. I., Lisitskaya I. V., Oleynikov R. V., “New ideology of the block symmetric ciphers security estimation against differential and linear cryptanalysis”, Prikl. radioelektr., 9:3 (2010), 312–320 (in Russian)

[7] Kazymyrov O., Oliynykov R., “Application of vectorial Boolean functions for substitutions generation used in symmetric cryptographic transformation”, Systemy obrabotki informacii (Kharkiv), 6(104), 2012, 97–102 (in Russian)

[8] Logachev O. A., Salnikov A. A., Yaschenko V. V., Boolean functions in the coding theory and cryptology, MCCME, M., 2004, 470 pp. (in Russian) | MR

[9] Ivanov G., Nikolov N., Nikova S., Reversed genetic algorithms for generation of bijective S-boxes with good cryptographic properties, IACR Cryptology ePrint Archive, , 19 pp. https://eprint.iacr.org/2014/801.pdf

[10] Beelen P., Leander G., “A new construction of highly nonlinear S-boxes”, Cryptogr. Commun., 4:1 (2012), 65–77 | DOI | MR | Zbl

[11] Fu S., Matsuura K., Li C., Qu L., “Construction of highly nonlinear resilient S-boxes with given degree”, Des. Codes Cryptogr., 64:3 (2012), 241–253 | DOI | MR | Zbl

[12] Kazymyrov O., Kazymyrova V., Oliynykov R., A method for generation of high-nonlinear S-boxes based on gradient descent, IACR Cryptology ePrint Archive, , 9 pp. https://eprint.iacr.org/2013/578.pdf

[13] J. Appl. Industr. Math., 5:1 (2011), 110–129 | DOI | MR | Zbl

[14] Zaibi G., Peyrard F., Kachouri A., Fournier-Prunaret D., Samet M., “A new design of dynamic S-Box based on two chaotic maps”, ACS/IEEE International Conference on Computer Systems and Applications-AICCSA 2010, IEEE, Piscataway, NJ, 2010, 1–6 | DOI

[15] Ahmad M., Khan P. M., Ansari M. Z., “A simple and efficient key-dependent S-box design using Fisher–Yates shuffle technique”, Recent Trends in Computer Networks and Distributed Systems Security, SNDS 2014, Commun. Comput. Inf. Sci., 420, 2014, 540–550 | DOI

[16] Pradeep L. N., Bhattacharjya A., “Random key and key dependent S-box generation for AES cipher to overcome known attacks”, Security in Computing and Communications, SSCC 2013, Commun. Comput. Inf. Sci., 377, 2013, 63–69 | DOI

[17] Hosseinkhani R., Javadi H. H. S., “Using cipher key to generate dynamic S-box in AES cipher system”, Int. J. Comput. Sci. Secur., 6:1 (2012), 19–28

[18] Mahmoud E. M., El Hafez A. A., Elgarf T. A., Zekry A., “Dynamic AES-128 with key-dependent S-box”, Int. J. Engrg Res. Appl., 3:1 (2013), 1662–1670 http://www.ijera.com/papers/Vol3_issue1/IW3116621670.pdf

[19] Schneier B., “Description of a new variable-length key, 64-bit block cipher (Blowfish)”, Fast Software Encryption, Lect. Notes Comput. Sci., 809, 1994, 191–204 | DOI | Zbl

[20] Kuznetsov A. A., Sergienko R. V., Nausko A. A., “Symmetric cryptographic algorithm ADE (Algorithm of Dynamic Encryption)”, Prikl. radioelektr., 6:2 (2007), 241–249 (in Russian)

[21] Bogdanov A., Knudsen L. R., Leander G., Paar C., Poschmann A., Robshaw M. J. B., Seurin Y., Vikkelsoe C., “PRESENT: an ultra-lightweight block cipher”, Cryptographic Hardware and Embedded Systems-CHES 2007, Lect. Notes Comput. Sci., 4727, 2007, 450–466 | DOI | Zbl

[22] Borghoff J., Knudsen L. R., Leander G., Thomsen S. S., “Cryptanalysis of PRESENT-like ciphers with secret S-boxes”, Fast Software Encryption, FSE 2011, Lect. Notes Comput. Sci., 6733, 2011, 270–289 | DOI | Zbl

[23] Polikarpov S. V., Rumyantsev K. E., Kozhevnikov A. A., “Pseudodynamical substitution tables: the base of contemporary symmetric cryptoalgorithms”, Nauchn. obozr., 2014, no. 12, 162–166 (in Russian)

[24] Polikarpov S. V., Rumyantsev K. E., Kozhevnikov A. A., “Pseudodynamical substitution tables: A study of differential characteristics”, Fiziko-matematicheskie metody i informatzionnye tekhnologii v estestvoznanii, tekhnike i gumanitarnykh naukakh, MCNIP, Kirov, 2015, 77–89 (in Russian)