איתי דינור

אקדמי בכיר

Improved attacks on full GOST

Itai Dinur, Orr Dunkelman, Adi Shamir

GOST is a well known block cipher which was developed in the Soviet Union during the 1970's as an alternative to the US-developed DES. In spite of considerable cryptanalytic effort, until very recently there were no published single key attacks against its full 32-round version which were faster than the 2256 time complexity of exhaustive search. In February 2011, Isobe used the previously discovered reflection property in order to develop the first such attack, which requires 232 data, 264 memory and 2224 time. In this paper we introduce a new fixed point property and a better way to attack 8-round GOST in order to find improved attacks on full GOST: Given 232 data we can reduce the memory complexity from an impractical 264 to a practical 236 without changing the 2224 time complexity, and given 264 data we can simultaneously reduce the time complexity to 2192 and the memory complexity to 236.

שפת פרסום אנגלית
דפים 9-28
סטטוס פרסום פורסם - 01.01.2012

Keywords

2D meet in the middle attack
Block cipher
GOST
cryptanalysis
fixed point property
reflection property

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
גישה למסמך
10.1007/978-3-642-34047-5_2
קבצים וקישורים אחרים
Link to publication in Scopus