## CryptoDB

### Paper: Cryptanalysis of GOST2

Authors: Tomer Ashur , COSIC-imec, KU Leuven Achiya Bar-On , Department of Mathematics, Bar-Ilan University Orr Dunkelman , Computer Science Department, University of Haifa DOI: 10.13154/tosc.v2017.i1.203-214 URL: http://tosc.iacr.org/index.php/ToSC/article/view/591 Search ePrint Search Google GOST 28147 is a 256-bit key 64-bit block cipher developed by the USSR, later adopted by the Russian government as a national standard. In 2010, GOST was suggested to be included in ISO/IEC 18033-3, but was rejected due to weaknesses found in its key schedule. In 2015, a new version of GOST was suggested with the purpose of mitigating such attacks. In this paper, we show that similar weaknesses exist in the new version as well. More specifically, we present a fixed-point attack on the full cipher with time complexity of 2237 encryptions. We also present a reflection attack with time complexity of 2192 for a key that is chosen from a class of 2224 weak keys. Finally, we discuss an impossible reflection attack which improves on exhaustive search by a factor of 2e, and several possible related-key attacks.
##### BibTeX
@article{tosc-2017-28105,
title={Cryptanalysis of GOST2},
journal={IACR Trans. Symmetric Cryptol.},
publisher={Ruhr-Universität Bochum},
volume={2017, Issue 1},
pages={203-214},
url={http://tosc.iacr.org/index.php/ToSC/article/view/591},
doi={10.13154/tosc.v2017.i1.203-214},
author={Tomer Ashur and Achiya Bar-On and Orr Dunkelman},
year=2017
}