Modification of the key schedule of the 2-GOST block cipher and its implementation on FPGA

For 2-GOST block lightweight cipher we will consider the Ashur-Bar-On-Dunkelman attack, show that its time complexity is underestimated and propose a modification of this attack with lower time and memory complexity (2(2.49) and 2(6.15) times smaller respectively). A new key schedule for 2-GOST will be proposed to counteract attacks using key schedule features such as fixed points, sliding pairs and so on. It will be shown that the new key schedule of 2-GOST leave it in the class of lightweight ciphers.