Springer (2017)ĭinur, I., Güneysu, T., Paar, C., Shamir, A., Zimmermann, R.: An experimentally verified attack on full Grain-128 using dedicated reconfigurable hardware. In: Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, 10–12 July 2017, Proceedings, pp. Ĭianfriglia, M., Guarino, S., Bernaschi, M., Lombardi, F., Pedicini, M.: A novel GPU-based implementation of the cube attack. In: International Conference on High Performance Computing Simulation (HPCS), pp. Ĭianfriglia, M., Guarino, S.: Cryptanalysis on GPUs with the cube attack: design, optimization and performances gains. ACM (1990)Ĭhakraborti, A., Chattopadhyay, A., Hassan, M., Nandi, M.: TriviA and uTriviA: two fast and secure authenticated encryption schemes. In: ACM Symposium on Theory of Computing, pp. Springer, Berlin (2010)īlum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. In: International Conference on Applied Cryptography and Network Security, ACNS 2010, pp. Accessed īiryukov, A., Priemuth-Schmid, D., Zhang, B.: Multiset collision attacks on reduced-round SNOW 3G and SNOW 3G+. Accessed 4 April 2018īertoni, G., Daemen, J., Peeters, M., Van Assche, G., Van Keer, R.: CAESAR submission: Ketje v2.
In: WCC2015-9th International Workshop on Coding and Cryptography (2015)īernstein, D.J.: Why haven’t cube attacks broken anything?. Springer (2009)īaksi, A., Maitra, S., Sarkar, S.: New distinguishers for reduced round Trivium and Trivia-SC using cube testers.
#MACTERM FONT ARCHIVE#
In: IACR Cryptology ePrint Archive (2009)Īumasson, J.P., Dinur, I., Meier, W., Shamir, A.: Cube testers and key recovery attacks on reduced-round MD6 and Trivium. Īumasson, J.P., Dinur, I., Henzen, L., Meier, W., Shamir, A.: Efficient FPGA implementation of high-dimensional cube testers on the stream cipher Grain-128.
2015, 40 (2015)Īhmadzadeh, A., Hajihassani, O., Gorgin, S.: A high-performance and energy-efficient exhaustive key search approach via GPU on DES-like cryptosystems. arXiv:1901.01337Īhmadian, Z., Rasoolzadeh, S., Salmasizadeh, M., Aref, M.R.: Automated dynamic cube attack on block ciphers: cryptanalysis of SIMON and KATAN. (2011)Īgostini, E., Bernaschi, M.: Bitcracker: Bitlocker meets GPUs. In: Proceedings of 9th Australasian Information Security Conference, AISC’11, pp. Accessed Īgnesse, A., Pedicini, M.: Cube attack in finite fields of higher order. We believe that our extensive set of results can be useful for the cryptographic engineering community at large and can pave the way to further results in the area.Īppendix to “Kite attack: reshaping the cube attack for a flexible GPU-based maxterm search”. Moreover, we demonstrate the scalability of our solution on multi-GPU systems. We include a thorough evaluation of the impact of system parameters and GPU architecture on the performance. In this paper, we also present the first standard cube attack (i.e., neither dynamic nor tester) to yield maxterms for Grain-128 up to 160 initialization rounds on non-programmable hardware. Our attack against Trivium improves the state of the art, permitting full key recovery for Trivium reduced to (up to) 781 initialization rounds (out of 1152) and finding the first-ever maxterm after 800 rounds. We report the results of running our GPU-based cube attack against round-reduced versions of three well-known ciphers: Trivium, Grain-128 and SNOW 3G. We address all issues posed by a GPU implementation, providing evidence in support of parallel variants of the attack and identifying viable directions for solving open problems in the future. The present paper follows a more practical approach and aims at giving new impetus to this line of research by means of a cipher-independent flexible framework that is able to carry out the cube attack on GPU/CPU clusters. On the theoretical side, promising results have been recently achieved leveraging on division trails. Nevertheless, the lack of implementations achieving effective results casts doubts on its practical relevance. Dinur and Shamir’s cube attack has attracted significant attention in the literature.
0 kommentar(er)
