Differential Cryptanalysis of GOST [pdf]
eprint.iacr.org
eprint.iacr.org
> We obtain some 50 distinct attacks faster than brute force on the full 32-round GOST and we provide five nearly practical attacks on two major 128-bit variants of GOST
I would need more context from a more trusted source to inform my own opinion on this work.
- Biham, E., & Shamir, A. (1991). Differential cryptanalysis of DES-like cryptosystems. Journal of CRYPTOLOGY, 4(1), 3-72.
AES : - Billet, O., Gilbert, H., & Ech-Chatbi, C. (2005, January). Cryptanalysis of a white box AES implementation. In Selected Areas in Cryptography (pp. 227-240). Springer Berlin Heidelberg.
- Bogdanov, A., Khovratovich, D., & Rechberger, C. (2011). Biclique cryptanalysis of the full AES. In Advances in Cryptology–ASIACRYPT 2011 (pp. 344-371). Springer Berlin Heidelberg.
The biclique attack on AES looks a lot more impractical than the results on GOST... Looks like O(2^124) time complexity and a stupendous amount of data if I scanned the paper properly....
So it's certainly of historical importance. It's not often that a math paper spurs millions of dollars of changes. As for scientific importance, it's a near-practical break in a well-used cryptosystem. The breaking of DES was a similar event, and that's considered of scientific importance by the cryptography community. This isn't quite as strong a break, as building a cracker would be quite expensive, 2^101 is quite a few operations, but it's not so far outside the realm of possibility as to be unthinkable.
Further, from the IACR website: Papers have been placed here by the authors and did not undergo any refereeing process other than verifying that the work seems to be within the scope of cryptology and meets some minimal acceptance criteria and publishing conditions.
Finally, a quick perusal of Google scholar makes their work look at least somewhat non-unique, but again, I am not sure. Let me repeat, it is just their style which set off a small alarm bell.